GPS accumulated delta range processing for navigation applications

ABSTRACT

Techniques for GPS navigation used to determine the position and velocity of a moving object. Pseudorange (PR) measurements and accumulated delta range (ADR) measurements are made at the object from received GPS signals. Differences are computed between ADR measurements that are separated by a time interval that is greater than a time interval between consecutive ADR measurements. Navigational parameters (e.g., position, velocity and clock) are estimated from the PR measurements and the ADR differences. The ADR measurement equations set for herein are formulated in a much more accurate way so that the time interval between the ADR measurements used to compute an ADR difference can be much larger than that used for current ADR differencing techniques in GPS navigation applications. Consequently, the ADR differences are more accurate, which translates into a much more accurate navigation solution. In addition, the ADR differencing technique contributes to shorten convergence times of the Kalman filter processing, and thereby improve the accuracy of spacecraft navigation. Techniques are also provided to extend these highly accurate ADR processing algorithms to integrated GPS/IMU navigation applications, where IMU data is used as an accurate propagation model to propagate the state vector.

RELATED APPLICATION

This application claims priority to U.S. Provisional Application No. 60/610,609, filed Sep. 17, 2004, entitled “GPS ADR Processing for Navigation of a Spacecraft,” the entirety of which is incorporated herein by reference.

FIELD OF THE INVENTION

The present invention relates to global positioning system (GPS) navigation technologies, and more particularly to navigation algorithms that use accumulated delta range (ADR) measurements for more accurate navigation results.

BACKGROUND OF THE INVENTION

GPS is a well established means of navigation for spacecraft, aircraft as well as Earth-based vehicles or persons. Typically, a user receives signals from GPS satellites and uses pseudorange (PR) measurements from data contained in the GPS signals to determine its position, velocity and other parameters. The term “user” refers to the object whose position is computed based on GPS or other ranging signals it receives. If an application requires high accuracy navigation, PR measurements are processed by a Kalman filter rather than by a point solution algorithm. A Kalman filter uses PR measurements and sophisticated propagation models to estimate the user position, velocity and other state vector parameters. Propagation models are designed to compute the state of the user at time N if the state is known at time N−1. They allow the Kalman filter to use the prior knowledge of the user state for computing the current estimate, thus improving the accuracy.

Unfortunately, even though propagation models can be quite accurate, this does not guarantee the accuracy of the propagated state. The propagation model uses the state vector estimate at the previous epoch as an input, and the accuracy of the latter may be a limiting factor. The accuracy of the propagated state is particularly vulnerable to errors in the object velocity estimate. Velocity is estimated indirectly by the Kalman filter due to its correlation with position.

Achieving high accuracy navigation is closely tied to estimating velocity accurately. This creates a circular dependence between position accuracy and the velocity accuracy. In practice, the estimation process is a gradual one, where improvements in accuracy of velocity and position facilitate each other over some time. The entire process is referred to as convergence of the Kalman filter. In a typical case, filter convergence for space applications takes from several hours to a day or even more. This may be a problem, especially after a spacecraft maneuver, when the filter has to re-converge.

There is room from improving the accuracy of GPS navigation processing, both in terms of the navigation solutions that are produced and the convergence time of the Kalman filter computations.

SUMMARY OF THE INVENTION

Briefly, techniques are provided for GPS navigation used to determine the position and velocity of a moving object. Pseudorange (PR) and accumulated delta range (ADR) measurements are made at the object from received GPS signals. Differences are computed between ADR measurements that are separated by a time interval that is greater than a time interval between consecutive ADR measurements. Navigational parameters (e.g., position, velocity and clock) are estimated from the PR measurements and the ADR differences.

One analogy to the techniques described herein is as follows. A person traveling in a car starts a stop watch as the car begins to travel. After some time interval, the person stops the stop watch and measures the distance that the car has traveled. Each time the stop watch is started and stopped, error is introduced. If a short time period is used to measure the distances, the estimate of the car speed will likely not be very accurate. Conversely, if the car moves at the constant speed, and if the person performs a measurement over a long period of time, the estimate of speed becomes much more accurate. While the second option is preferable, it is not always feasible since the assumption of the constant speed may be invalid. Moreover, measuring speed over a relatively long time interval produces the average speed over this time interval. The average speed is of little practical use, since most applications require knowledge of the current state.

This techniques described herein combine the advantage of measuring an object's velocity over relatively long time intervals with the ability to accurately map such measurements to instantaneous velocity at the time of processing. This is accomplished by processing differenced ADR measurements and by applying a mathematical formulation that accurately maps such differences to the current state vector of the user.

The ADR measurement equations set forth herein are formulated in a much more accurate way so that the time interval between the ADR measurements used to compute an ADR difference can be much larger than that used for current ADR differencing techniques in GPS navigation applications. Consequently, the ADR differences are more accurate, which translates into a much more accurate navigation solution. In addition, the ADR differencing technique contributes to shorten convergence times of the Kalman filter processing, and thereby improve the navigation accuracy.

The difficulty in using ADR measurements is that they relate to quantities which are accumulated/integrated over some time interval, whereas a Kalman filter requires instantaneous measurements. This difficulty is overcome with the techniques described herein by a mathematical formulation that accurately maps ADR measurements into instantaneous measurements. Moreover, such instantaneous measurements are primarily for velocity and therefore provide a direct means to estimate velocity of the object.

There are many benefits from using ADR measurements with the mathematical formulations described herein. Velocity estimates combined with a propagation model immediately results in a more accurate propagated state, which enables a dramatic reduction in the convergence time of the Kalman filter. Use of ADR measurements in addition to PR approximately doubles the total number of measurements used for processing. In addition, ADR measurements have much lower noise than PR measurements. More measurements and lower noise result in better overall accuracy.

Techniques are also provided to extend these highly accurate ADR processing algorithms to navigation applications where a reliable propagation model may not be available for a particular object movement. For example, accurate propagation models are not available for certain aircraft, land-vehicles, persons, etc. However, if these objects have the capability to make inertial measurements such as acceleration and rotation rate, the inertial measurements may be used to aid ADR difference processing.

Other objects and advantages will become more readily apparent when reference is made to the following description taken in conjunction with the accompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a navigation system including GPS satellites and navigation unit that resides in a moving object, and which uses PR and ADR measurements to compute navigation parameters based solely on GPS signals or based on GPS signals and IMU data.

FIG. 2 is a diagram showing the measurements and parameters that are input into a Kalman filter for the navigation computations based on PR and ADR measurements.

FIG. 3 is a flow chart showing the overall navigation computation process based on PR and ADR measurements.

FIG. 4 is a diagram that pictorially represents how ADR differences are computed from two ADR measurements separated in time by multiple epochs.

FIG. 5 is a flow chart showing the processing steps for the GPS-only navigation computations based on PR and ADR measurements.

FIG. 6 is a flow chart showing the processing steps for using IMU data to propagate the state vector in for integrated GPS-IMU navigation computations.

FIG. 7 is a diagram containing plots of navigation error versus time for the GPS-only navigation computations represented by the flow chart of FIG. compared with conventional GPS processing.

FIG. 8 is a diagram containing plots of navigation error versus time for the first two minutes of ADR processing, magnified from the plots shown in FIG. 7.

FIG. 9 is a diagram containing plots of root-sum-squared navigation errors as function of time using first order propagation of IMU data for PR measurements only.

FIG. 10 is a diagram containing plots of root-sum-squared navigation errors as function of time using third order propagation of IMU data for PR measurements only.

FIG. 11 is a diagram containing plots of root-sum-squared navigation errors as function of time using third order propagation of IMU data for PR and ADR measurements.

DETAILED DESCRIPTION

FIG. 1 illustrates an environment where the navigational techniques described herein are useful. An object 10 is shown whose position is to be computed from signals received from a plurality global positioning system (GPS) satellites 20(1) to 20(N). The object 10 may be a spacecraft such as a satellite or space vehicle, earth land or air vehicle (e.g., car, truck, tank, airplane, helicopter, ship, etc.). The object 10 has a receiver 12 that is capable of receiving signals from the GPS satellites 20(1) to 20(N), a processor 14 that makes measurements from the received signals and computes the position, velocity, direction, etc., of the object, and a object interface 16 (such as a keyboard and display) to convey navigational information to a human, if desired. In addition, the object may include an inertial measurement unit (IMU) 18 that outputs measurement data for acceleration and rotation rate of the object. The processor 14 performs computations on measurements derived from the received GPS signals.

The receiver 14 makes pseudorange (PR) measurements and accumulated delta range (ADR) measurements from the received GPS signals. The processor 14 then makes Kalman filter computations on the PR and ADR measurements using measurement equations, and updates the state vector using propagation modeling computations or using the IMU data.

FIG. 1 also shows that while GPS satellites 20(1) to 20(N) are commonly used to determine position, there are other ranging sources that transmit ranging signals. Reference numeral 22 is intended to represent these other ranging sources, such as ground based systems or indoor position tracking systems. GPS signals are meant to be only an example of the type of ranging signals with which the techniques described herein may be employed.

A Kalman filter is an optimal linear estimator that estimates a state vector (e.g., position, velocity, and clock) from multiple measurements of various types (e.g., PR and ADR measurements). PR and ADR measurements are made from the received GPS signals on a repeated basis, where each measurement event is called an “epoch”. The Kalman filer produces a minimum variance estimate in the least squares sense. In addition to the navigation state it generally estimates errors in the overall navigation state. The filter outputs a measure of the accuracy of its error state vector estimate. This measure of accuracy is represented by a covariance matrix, which is a matrix of second central moments of the errors in the state estimate.

Typically, a Kalman filter is applied in a cycle, where the algorithm alternates between processing available measurements (with a measurement model represented by measurement equations) and propagating the solution of the state vector to the next epoch (with a propagation model represented by propagation equations). The propagation model is a process that describes how the error state vector changes in time. The measurement model defines the relationship between the error state vector and any measurements processed by the filter. The accuracy of the solution depends on the quality and quantity of the measurements, on the accuracy of measurement equations, and on the accuracy of propagation routines. For nonlinear problems such as estimation of a satellite state, measurement equations are typically linearized.

Linearization includes computation of partial derivatives of the measured quantity with respect to the components of the state vector. Computation of such partial derivatives for PR measurements is straightforward, and is the foundation for conventional navigation algorithms. However, computation of partial derivatives for ADR measurements is more complex. The primary difficulty is the time mismatch: the state vector represents the satellite state at a particular time, whereas ADR measurements represent an accumulation of phase measurements over some time interval. One technique is to map ADR measurements from a time interval to a time instant. Such mapping will necessarily be an approximation and will introduce an error in the navigation solution, in addition errors from measurement noise.

Conceptually, the Kalman filter weights the relative contributions of the measurements and of the dynamic behavior of the state vector. The measurements and state vector are weighted by their respective covariances. If the measurements are inaccurate (large variances) when compared to the state vector estimate, then the filter deemphasizes the measurements. When the measurements are very accurate (small variances) when compared to the state vector estimate, the filter will weigh the measurements heavily such that its previously computed state estimate will contribute little to the latest state estimate.

Even a naïve approach to processing ADR data can yield measurement equations, which are more accurate than underlying ADR measurements (i.e., error in the measurement equations is smaller than the measurement noise). Yet the effect of a seemingly insignificant error in measurement equations on the navigation accuracy can be quite large. The reason for this is that this error is highly correlated in time and therefore not removed by filtering.

A danger from long-term correlated errors in measurement equations can be appreciated by examining similar effects for the propagation. Measurement processing and propagation are two stages of a Kalman filter algorithm, and are executed at each cycle. It is well known that small unaccounted acceleration errors in a propagation model may accumulate over time and affect the navigation accuracy. This effect has forced development of sophisticated and precise propagation models.

It is intuitively clear that similar effects must be true for measurement equations. Indeed, an error in the measurement equations would tend to “pull” the object (e.g., spacecraft) at each epoch at the update (data processing) stage of processing, and would have an effect similar to that from unmodeled acceleration at the propagation stage. The effect from such error on the navigation solution may be substantial. In this case, using measurements with long-term errors may be worse than not using ADR measurements at all. Thus, use of ADR measurements in navigation is highly dependent on the ability to map them to the state vector with no or little long-term correlated errors. This accuracy requirement can be quantified as follows: correlated errors in the measurement equations should be below or of the order of errors in the propagation equations. In this case, using measurement equations for ADR will be more likely to make the accuracy better.

This is definitely possible for relative navigation, e.g., satellite formation flying. Differencing and double differencing removes biases and allows for extraordinary accuracy in relative navigation solutions. However, it is less evident how to develop an accurate algorithm for applying ADR measurements for absolute navigation applications. This may be the reason for not using ADR measurements for absolute navigation of spacecraft in many previous applications.

An important aspect of the techniques described herein is a mathematical formulation, which enables accurate ADR measurement processing for absolute navigation of spacecraft. This ADR processing is complementary to, and used in conjunction with conventional PR processing. The primary distinguishing feature of the following algorithm to be described is its accuracy. The measurement equations contain unaccounted errors, but the magnitude of these errors is reduced to the same order as that of unmodeled propagation errors.

With reference to FIG. 2, a high-level pictorial representation of the navigation processing is shown. The moving object uses the received GPS signals to derive PR measurements and ADR differences (from two ADR measurements separated in time) using techniques described below in conjunction with FIG. 3. The PR measurements and ADR differences are supplied to the Kalman filter represented by block 70. Also supplied to the Kalman filter are a propagation model, if known, for the object 10 and/or IMU data if the object 10 includes an IMU. The IMU data is useful in circumstances where integrated GPS-IMU navigation computations are to be performed, such as when a reliable propagation model is not known for the object 10.

Turning to FIG. 3, the basic steps for the GPS-only or GPS-IMU navigation algorithm will be described. In step 80, the object 10 receives ranging signals, such as GPS navigation signals from GPS satellites or ranging signals from other ranging sources as shown in FIG. 1. Next, in step 82 the object makes PR and ADR measurements from the ranging signals received in step 80. In step 84, a difference is computed between two ADR measurements at two epochs (e.g., time instants) that are separated by a time interval that is greater than a time interval between consecutive ADR measurements. This ADR differencing technique is described in more detail in conjunction with FIG. 4. In step 86, the ADR differences are processed using modified partial derivative equations in the Kalman filter, and the state vector is propagated either using the propagation model (and the PR measurements) or by propagating the state vector using IMU data obtained by the object. The modified partial derivative equations are described in more detail hereinafter in connection with FIG. 5. The techniques for propagating the state vector using the IMU data is described in conjunction with FIG. 6. Again, the techniques of FIG. 6 are useful in navigation applications where the object whose position is to be measured does not have a predictable acceleration and thus a reliable propagation model is not known.

I. ADR Measurement Processing Equations for GPS-Only and Integrated GPS-IMU Navigation

A. Canceling Bias

ADR data has an unknown constant bias (if there are no cycle slips). Due to this bias, ADR measurements cannot be applied in the same way as PR measurements. One well known method of dealing with the bias is estimating it, e.g. by using ADR to smooth PR measurements. A technique that is superior to smoothing is described herein for processing ADR measurements and eliminating the bias.

A general way to exclude bias is to use a measurement in the following form:

$\begin{matrix} {\overset{\_}{P} = {\int_{t_{1}}^{t_{2}}{{{P(t)} \cdot {W(t)}}\ {\mathbb{d}t}}}} & (1.1) \end{matrix}$

where P(t) is the ADR measurement, and the weight function W(t) is selected in such way, that

∫_(t₁)^(t₂)W(t) 𝕕t = 0. One can verify by direct substitution that equation (1.1) cancels a constant bias contained in ADR measurement P(t). Weights W(t) can be selected to minimize errors in the resulting measurement P and to improve the results of its processing by the Kalman filter.

To illustrate the benefits of using equation (1.1), a special case of weighting function W(t) is considered, which yields simply a difference of ADR values P=ΔP=P(t_(n))−P(t_(n−1)) at two epochs t_(n−1), t_(n). This is probably the simplest (though not the optimal) expression that cancels the bias, and it produces the following measurement:

$\begin{matrix} {{\Delta\; P} = {\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} - \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}} + {\int_{t_{n - 1}}^{t_{n}}{\overset{.}{\tau}\ {\mathbb{d}t}}}}} & (1.2) \end{matrix}$

where {right arrow over (r)}_(n) is the position vector of the object, {right arrow over (r)}_(s, n) is the position vector of a GPS satellite, {dot over (τ)} is the object clock drift, and subscripts n, n−1 denote two epochs (not necessarily consecutive). The nature of equation (1.2) is that of relative velocity between the object and the GPS satellite, integrated over some time interval. In known ADR processing techniques, the two time instances t_(n−1), t_(n) for which ADR values are differenced correspond to two consecutive epochs. By contrast, in the ADR processing techniques described herein, the quality of ADR measurement can be greatly improved if these two time instances are separated by a longer time interval. In a more general formulation, this corresponds to a wider range of t where weighting function W(t) is non-zero. The simpler case of using measurement equation (1.2) can bring substantial benefits. Further improvement may be possible by using measurement in the form of formula (1.1).

B. Choosing the Time Interval Between ADR Measurements for the ADR Difference Computation

Equation (1.2) does not specify the duration of the time interval between the two epochs for which the ADR difference computation is made. Choice of the duration of this time interval is very important for reaching the full potential of the method suggested below.

Based on the qualitative considerations presented above, the basic, rough form of velocity estimate derived from two ADR measurements is:

$\begin{matrix} {V = \frac{{P\left( t_{n} \right)} - {P\left( t_{n - 1} \right)}}{t_{n - 1} - t_{n}}} & (1.3) \end{matrix}$

The following description specifies the measurement equation to be used in the Kalman filter. For the purposes of this description, it is necessary only to know that the propagation model will be used to formulate it, and errors in the propagation model will contribute to the errors in the velocity estimate along with the measurement noise in ADR measurements. Thus, extending the time interval between ADR measurements for computing an ADR difference is dependent on the accuracy of the propagation model. A more accurate propagation model will allow for a longer time interval between ADR measurements for computing the ADR difference. Similarly, more accurate IMU data and use of IMU data for propagation purposes (as described hereinafter in conjunction with FIG. 6), will allow for a longer time interval between ADR measurements for the difference computation.

Errors in the propagation model δ{circumflex over (P)} are assumed to be due to unmodeled accelerations, and can be estimated as follows:

$\begin{matrix} {{\delta\overset{\Cap}{P}} \approx {\frac{1}{2}\delta\;{a \cdot \left( {t_{n} - t_{n - 1}} \right)^{2}}}} & (1.4) \end{matrix}$

where δa is the unmodeled acceleration. The measurement noise in the two ADR measurements are accounted for and are assumed to be not correlated. Their variances are assumed to be equal and are denoted by σ_(P) ²

The total variance of the velocity estimate error can be approximated as follows:

$\begin{matrix} {\sigma_{V}^{2} = \frac{{2\sigma_{P}^{2}} + {\frac{1}{4}\delta\;{a^{2} \cdot \left( {t_{n - 1} - t_{n}} \right)^{4}}}}{\left( {t_{n - 1} - t_{n}} \right)^{2}}} & (1.5) \end{matrix}$

It is straightforward to find the minimum of this variance with respect to the duration of the time interval. This defines the optimal duration to be used in applying this techniques described herein:

$\left( {t_{n - 1} - t_{n}} \right)_{opt} = {2^{\frac{3}{4}} \cdot \left( \frac{\sigma}{{\delta\; a}} \right)^{\frac{1}{2}}}$

If the quality of the propagation model is such that unmodeled accelerations are of the order of |≡a|≈10⁻⁶ m/s² and if the ADR noise is of the order of 10⁻² m, then the optimal duration of the interval between the two epochs for which the ADR difference computation is made is on the order of 100 s, where each epoch is approximately 1 sec.

With reference to FIG. 4, an example is shown to illustrate how ADR differences are computed. Whereas current GPS navigation techniques compute a difference between consecutive ADR measurements, it has been found that computing a difference between ADR measurements separated by a time interval that is greater, and particularly substantially greater, than the time interval between ADR measurements, can produce much more accurate navigation solutions, and assist in the Kalman filter converging faster. For example, FIG. 4 shows that an ADR difference is computed between an ADR measurement at epoch E₁ and an ADR measurement at epoch E₁₀₀ (where each epoch is approximately 1 sec apart), between an ADR measurement at epoch E₂ and an ADR measurement at epoch E₁₀₁, between an ADR measurement at epoch E₃ and an ADR measurement at epoch E₁₀₂, and so on. Thus, with this example, ADR differences are computed for each new ADR measurement as it is received.

It is not necessary that an ADR difference be computed for each new ADR measurement with respect to a prior ADR measurement many epochs preceding it. ADR differences can be computed between ADR measurements, separated by a suitable period of time (e.g., number of epochs) that do not necessarily using each and every ADR measurement that is made. For example, an ADR difference can be computed between an ADR measurement at epoch E₁ and an ADR measurement at epoch E₁₀₀, and ADR measurement at epoch E₁₀₁ and an ADR measurement at epoch E₂₀₀, and so on. Still another possibility is to compute an ADR difference between epoch E₁ and an ADR measurement at epoch E₁₀₀, between epoch E₁₀ and an ADR measurement at epoch E₁₁₁, between epoch E₂ and an ADR measurement at epoch E₁₂₁, etc. These ADR differences are processed using modified partial derivative equations described below.

Note that both small (e.g., 1 s) or very large (e.g. 10⁴ s) time intervals would result in larger errors in the velocity estimate. For the optimal duration, errors in the velocity estimate can be estimated by substituting the optimal value for duration in equation (2), to yield: σ_(Vopt)≈10⁻⁴ m/s  (1.6)

This estimate for error is small compared to other means of estimating velocity. It is particularly impressive as a result of processing a single measurement. Of course, the potential for obtaining such high-quality measurements can only be realized using measurement equations with a comparable accuracy. The following sections present a derivation for the measurement equations that are useful for processing ADR differences computed as described above.

C. Mitigating Object Clock Errors

The following derivation assumes that a good propagation model is available for the object position and velocity (i.e., position and velocity of object 10), which is typically the case for satellite objects. Unfortunately, the propagation model for the clock may be less accurate (if an inexpensive clock is used), and therefore the last term in equation (1.2) is difficult to estimate accurately. If partials are computed for the right-hand side of equation (1.2), a dominant one would be due to the clock drift, and it may create problems for accurate estimation of other components of the state vector (mainly, velocity).

In Kalman filter processing of ADR measurements, the estimation of the clock drift is separated from the estimation of velocity. Totally clean separation is neither feasible nor necessary; the goal is to be able to estimate velocity in the presence of an unstable clock. We observe that the last term in equation (1.2) has the same value for all satellites in view, and thus can be canceled by differencing measurements. Thus, the measurement residual for a satellite pair (p, q) to be used in the Kalman filter is as follows:

$\begin{matrix} {{\Delta\; P_{p}} - \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{{sp},n}} \right)^{2} \right\rbrack^{\frac{1}{2}} + \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{{sp},{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}} - {\Delta\; P_{q}} + \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{{sq},n}} \right)^{2} \right\rbrack^{\frac{1}{2}} - \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{{sq},{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}} & (1.7) \end{matrix}$

This residual can be readily computed from available ADR measurements and from known or estimated positions of GPS satellites and the object.

The measurement residual in the form of expression (1.7) can be used to estimate velocity. For the clock drift, we use any one of the single measurements in the form given by equation (1.2).

To use a measurement in the Kalman filter, the partials matrix must be computed. The challenge in computing the partials matrix is that an instantaneous measurement model is needed, whereas equation (1.2) is for velocity integrated over a period of time. This difficulty is overcome by the processing methodology described below in conjunction with the flow chart of FIG. 5. The goal of the processing steps shown in FIG. 5 and described below is to compute derivatives of the ADR differences with respect to one or more components at the current time of the state vector (e.g., the state vector velocity and position components) to produce instantaneous velocity estimates that are used to update the velocity component of the state vector. The PR measurements are also processed in the Kalman filter to update the position component, and a known propagation model or IMU data (as described hereinafter in conjunction with FIG. 6) is used to propagate the state vector. These techniques, as will become apparent hereinafter, have higher-order accuracy than prior art GPS navigation techniques with respect to the time separation between ADR measurements, e.g. the error is ˜x⁴, where x is a small parameter proportional to the time difference between measurements, compared to the error ˜x of prior art navigation techniques.

This method comprises computing partial derivatives of the object position at the past epoch with respect to the state vector at the current epoch. This computation is a higher-order approximation (e.g., 4^(th) order) with respect the time difference between epochs, using the propagation model as an underlying engine.

D. Partials with Respect to Position and Velocity in the Inertial Frame of Reference

Since equation (1.2) is a scalar, it can be formulated using any frame of reference. In this subsection, an inertial frame of reference is used. To compute partials in Earth-fixed frame (ECEF), they are first computed in the inertial frame, which is defined as having the same axis orientation as the ECEF frame at epoch n. The results will be used later to compute partials in the ECEF frame.

To keep equations less cumbersome, partials are obtained using equation (1.2) that correspond to one of the satellites in the pair, i.e. compute:

$\begin{matrix} \frac{\partial\left\{ {\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} - \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}} \right\}}{\partial\overset{\rightarrow}{X}} & (1.8) \end{matrix}$

where {right arrow over (X)} is the object state vector comprising position, velocity, clock, and clock drift of the object.

Thus, in step 100, the state vector may be converted from the ECEF frame of reference to an inertial frame of reference. Computation 100 is optional. Transformation to and from the ECEF frame is optional.

Partial derivatives in expression (1.8) are computed only with respect to position and velocity components of the state vector at epoch n. This partition of the state vector is denoted as {right arrow over (x)}_(n)={{right arrow over (r)}_(n), {right arrow over (v)}_(n)}. Partials with respect to clock and clock drift are computed separately.

Since object position {right arrow over (r)}_(n) is explicitly used in expression (1.8), it creates an impression that it is necessary only to compute partials with respect to it. However, object position {right arrow over (r)}_(n) is the result of the state vector propagation from epoch n−1. Thus, {right arrow over (r)}_(n) is a function of {right arrow over (x)}_(n−1); hence {right arrow over (x)}_(n−1) is an (inverse) function of {right arrow over (r)}_(n), and {right arrow over (r)}_(n−1) (being a part of {right arrow over (x)}_(n−1)) is a function of {right arrow over (r)}_(n). This results in a more complex computation of the derivatives:

$\begin{matrix} {\begin{matrix} {{\frac{\partial}{\partial{\overset{\rightarrow}{x}}_{n}}\begin{Bmatrix} {\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} -} \\ \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}} \end{Bmatrix}} = {\frac{\chi\left( {{\overset{\rightarrow}{x}}_{n} - {\overset{\rightarrow}{x}}_{s,n}} \right)}{\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}} -}} \\ {\frac{\left\lbrack {\Lambda^{T}\left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)} \right\rbrack}{\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}}} \end{matrix}{where}} & (1.9) \\ {\Lambda_{ij} = \frac{\partial r_{{n - 1},i}}{\partial x_{n,j}}} & (1.10) \end{matrix}$

and χ is a 6×6 matrix, which contains all zeroes, except for the first three elements of the main diagonal, which are equal to 1. The right-hand side of equation (1.9) is a partition of the partials matrix, which can be used in the Kalman filter for measurement processing.

In equation (1.9), the matrix Λ is used. As it was explained above, this matrix is due to dependence between state vectors at two epochs, which in turn is due to propagation of the state vector.

II. Further ADR Processing

A. GPS-Only Navigation

To propagate a state vector, all components of the state vector are needed. If the velocity component is lacking, propagation cannot be done. Note that matrix Λ uses position only at epoch n−1 and both position and velocity at epoch n. This makes it necessary to propagate backwards, i.e. from epoch n to epoch n−1, or in other words over a time interval separating the ADR measurements for which the differences are computed.

Thus, in step 110, the state vector is propagated back one step using a propagation routine, such as the Runge-Kutta scheme. Propagation is governed by ordinary differential equations. Many propagation routines use the so called “Runge-Kutta” scheme to ensure high accuracy. When computing matrix Λ, a high level of accuracy is maintained by using a 4^(th) order Runge-Kutta method for the underlying propagation algorithm. This propagation algorithm does not have to match exactly the one used for propagating the state vector (there are several equally good Runge-Kutta schemes). An example of a useful Runge-Kutta scheme is represented by the following equation set:

$\begin{matrix} {{\frac{\mathbb{d}\overset{\rightarrow}{x}}{\mathbb{d}t} = {\overset{\rightarrow}{f}\left( {t,\overset{\rightarrow}{x}} \right)}}{{\overset{\rightarrow}{x}}_{n + 1} = {{\overset{\rightarrow}{x}}_{n} + {\frac{1}{6}\left( {{\overset{\rightarrow}{k}}_{1} + {2{\overset{\rightarrow}{k}}_{2}} + {2k_{3}} + {\overset{\rightarrow}{k}}_{4}} \right)}}}{{\overset{\rightarrow}{k}}_{1} = {h \cdot {\overset{\rightarrow}{f}\left( {t_{n},{\overset{\rightarrow}{x}}_{n}} \right)}}}{{\overset{\rightarrow}{k}}_{2} = {h \cdot {\overset{\rightarrow}{f}\left( {{t_{n} + {\frac{1}{2}h}},{{\overset{\rightarrow}{x}}_{n} + {\frac{1}{2}{\overset{\rightarrow}{k}}_{1}}}} \right)}}}{{\overset{\rightarrow}{k}}_{3} = {h \cdot {\overset{\rightarrow}{f}\left( {{t_{n} + {\frac{1}{2}h}},{{\overset{\rightarrow}{x}}_{n} + {\frac{1}{2}{\overset{\rightarrow}{k}}_{2}}}} \right)}}}{{\overset{\rightarrow}{k}}_{4} = {h \cdot {\overset{\rightarrow}{f}\left( {{t_{n} + h},{{\overset{\rightarrow}{x}}_{n} + {\overset{\rightarrow}{k}}_{3}}} \right)}}}} & (1.11) \end{matrix}$

where h is the step of the propagation. The set of equations in (1.11) is written in a canonical form, i.e. when equations are propagated from epoch n to epoch n+1. Since it is necessary to propagate in the opposite direction, h is replaced with (−h) in equation set (1.11).

To compute matrix Λ the partial derivatives

$\frac{\partial x_{{n + 1},i}}{\partial x_{n,j}}$ are computed:

$\begin{matrix} {\frac{\partial x_{{n + 1},i}}{\partial x_{n,j}} = {\delta_{ij} + {\frac{1}{6}\left( {\frac{\partial k_{1,i}}{\partial x_{n,j}} + {2\frac{\partial k_{2,i}}{\partial x_{n,j}}} + {2\frac{\partial k_{3,i}}{\partial x_{n,j}}} + \frac{\partial k_{4,i}}{\partial x_{n,j}}} \right)}}} & (1.12) \end{matrix}$

where δ_(ij) is the Kronecker delta function, and

$\begin{matrix} {{\frac{\partial k_{1,i}}{\partial x_{n,j}} = {h \cdot \frac{\partial{f_{i}\left( {t_{n},{\overset{\rightarrow}{x}}_{n}} \right)}}{\partial x_{n,j}}}}{\frac{\partial k_{2,i}}{\partial x_{n,j}} = {h \cdot \frac{\partial{f_{i}\left( {{t_{n} + {\frac{1}{2}h}},{{\overset{\rightarrow}{x}}_{n} + {\frac{1}{2}{\overset{\rightarrow}{k}}_{1}}}} \right)}}{\partial x_{n,j}}}}{\frac{\partial k_{3,i}}{\partial x_{n,j}} = {h \cdot \frac{\partial{f_{i}\left( {{t_{n} + {\frac{1}{2}h}},{{\overset{\rightarrow}{x}}_{n} + {\frac{1}{2}{\overset{\rightarrow}{k}}_{2}}}} \right)}}{\partial x_{n,j}}}}{\frac{\partial k_{4,i}}{\partial x_{n,j}} = {h \cdot \frac{\partial{f_{i}\left( {{t_{n} + h},{{\overset{\rightarrow}{x}}_{n} + {\overset{\rightarrow}{k}}_{3}}} \right)}}{\partial x_{n,j}}}}} & (1.13) \end{matrix}$

For brevity the following notations are introduced:

$\begin{matrix} {{{\Psi_{\;{ij}}\left( {t_{\; n},{\;\overset{\rightarrow}{x}}_{n}} \right)} = \frac{{\partial\; f_{\; i}}\left( \;{t_{\; n},\;{\;\overset{\rightarrow}{x}}_{n}} \right)}{\partial\; x_{\;{n,\; j}}}}{\Psi_{\;{1,\;{ij}}} \equiv {\Psi_{\;{ij}}\left( {t_{\; n},{\;\overset{\rightarrow}{x}}_{n}} \right)}}{\Psi_{\;{2,\;{ij}}} = {{{\Psi_{\;{ij}}\left( {{t_{\; n} + {\frac{1}{\; 2}h}},{{\;\overset{\rightarrow}{x}}_{n} + {\frac{1}{\; 2}{\;\overset{\rightarrow}{k}}_{1}}}} \right)}\Psi_{\;{3,\;{ij}}}} = {{{\Psi_{\;{ij}}\left( {{t_{\; n} + {\frac{1}{\; 2}h}},{{\;\overset{\rightarrow}{x}}_{n} + {\frac{1}{\; 2}{\;\overset{\rightarrow}{k}}_{2}}}} \right)}\Psi_{\;{4,\;{ij}}}} = {\Psi_{\;{ij}}\left( {{t_{\; n} + h},{{\;\overset{\rightarrow}{x}}_{n} + {\;\overset{\rightarrow}{k}}_{3}}} \right)}}}}} & (1.14) \end{matrix}$

Substitution of equation set (1.4) into equation set (1.13) and computation of partial derivatives yields the following:

$\begin{matrix} {{\frac{\partial k_{1,i}}{\partial x_{n,j}} = {h \cdot \Psi_{1,{ij}}}}{\frac{\partial k_{2,i}}{\partial x_{n,j}} = {h \cdot {\sum\limits_{q}{\Psi_{2,{iq}} \cdot \left( {\delta_{qj} + {\frac{1}{2}\frac{\partial k_{1,q}}{\partial x_{n,j}}}} \right)}}}}{\frac{\partial k_{3,i}}{\partial x_{n,j}} = {h \cdot {\sum\limits_{p}{\Psi_{3,{ip}} \cdot \left( {\delta_{pj} + {\frac{1}{2}\frac{\partial k_{2,p}}{\partial x_{n,j}}}} \right)}}}}{\frac{\partial k_{4,i}}{\partial x_{n,j}} = {h \cdot {\sum\limits_{m}{\Psi_{4,{im}} \cdot \left( {\delta_{mj} + \frac{\partial k_{3,m}}{\partial x_{n,j}}} \right)}}}}} & (1.15) \end{matrix}$

Substituting

$\frac{\partial k_{1,i}}{\partial x_{n,j}}$ from the first equation of equation set (1.15) into the second one, and continuing such chain substitutions until the last equation, derivatives of k with respect to x_(n) are obtained, which are expressed through matrices Ψ₁₋₄. Then, all of these equations are substituted into equation (1.12) to obtain the following:

$\begin{matrix} {\frac{\partial\; x_{\;{{n\; + \; 1},\; i}}}{\partial\; x_{\;{n,\; j}}} = {\delta_{\;{ij}} + {\frac{1}{\; 6}\left( {{h\;\Psi_{\; 1}} + {2h\;\Psi_{\; 2}} + {2h\;\Psi_{\; 3}} + \Psi_{\; 4} + {h^{\; 2}\Psi_{\; 2}\Psi_{\; 1}} +} \right.}}} & (1.16) \\ {\mspace{40mu}{{h^{\; 2}\Psi_{\; 3}\Psi_{\; 2}} + {h^{\; 2}\Psi_{\; 4}\Psi_{\; 3}} + {\frac{1}{\; 2}h^{\; 3}\Psi_{\; 3}\Psi_{\; 2}\Psi_{\; 1}} + {\frac{1}{\; 2}h^{\; 3}\Psi_{\; 4}\Psi_{\; 3}\Psi_{\; 2}} +}} & \; \\ \left. \mspace{526mu}{\frac{1}{\; 4}h^{\; 4}\Psi_{\; 4}\Psi_{\; 3}\Psi_{\; 2}\Psi_{\; 1}} \right)_{ij} & \; \end{matrix}$

This is a cumbersome formula containing multiple products of 6×6 matrices. Fortunately, a considerable simplification can be made due to the special form of the Ψ matrices.

Note that x_(n+1), x_(n) in equation (1.16) correspond to r_(n−1,i), x_(n,j) in equation (1.9). Vector {right arrow over (r)}_(n−1) is expressed in the inertial reference system. Moreover, it is assumed that the object motion in orbit is primarily due to a potential gravitational field U(t,x). This means that function {right arrow over (ƒ)}(t,{right arrow over (x)}) in the first equation of set (1.11) has the following form:

$\begin{matrix} {{{\overset{\rightarrow}{f}\;}_{r} = {\left( {t,\overset{\rightarrow}{x}} \right) = \overset{\rightarrow}{v}}}{{{\overset{\rightarrow}{f}}_{v}\left( {t,\overset{\rightarrow}{x}} \right)} = \frac{\partial{U\left( {t,\overset{\rightarrow}{r}} \right)}}{\partial\overset{\rightarrow}{r}}}} & (1.17) \end{matrix}$

i.e., the first three components of {right arrow over (ƒ)}(t,{right arrow over (x)}) (which are responsible for derivatives of the position) are simply those of velocity, and the last three components (which are responsible for derivatives of the velocity) are functions of the position only. This fact is used to simplify the right-hand side of equation (16).

Derivatives of {right arrow over (ƒ)}(t,{right arrow over (x)}) (as needed for equation set (1.14)) are as follows:

$\begin{matrix} {\Psi = \begin{pmatrix} \hat{0} & I \\ \varphi & \hat{0} \end{pmatrix}} & (1.18) \end{matrix}$

where {circumflex over (0)} is a zero 3×3 matrix, I is the identity 3×3 matrix, and φ is a 3×3 matrix defined as follows:

$\begin{matrix} {\varphi_{ij} = \frac{\partial^{2}{U\left( {t,x} \right)}}{{\partial x_{i}}{\partial x_{j}}}} & (1.19) \end{matrix}$

Products of Ψ matrices now can be simplified:

$\begin{matrix} {{{\Psi_{b}\Psi_{a}} = \begin{pmatrix} \varphi_{a} & \hat{0} \\ \hat{0} & \varphi_{b} \end{pmatrix}}{{\Psi_{c}\Psi_{b}\Psi_{a}} = \begin{pmatrix} \hat{0} & \varphi_{b} \\ {\varphi_{c}\varphi_{a}} & \hat{0} \end{pmatrix}}{{\Psi_{d}\Psi_{c}\Psi_{b}\Psi_{a}} = \begin{pmatrix} {\varphi_{c}\varphi_{a}} & \hat{0} \\ \hat{0} & {\varphi_{d}\varphi_{b}} \end{pmatrix}}} & (1.20) \end{matrix}$

where subscripts a, b, c, d take values 1 through 4. Substitution of equation (1.20) into equation (1.16) yields the following expression:

$\begin{matrix} {\frac{\partial{\overset{\rightarrow}{x}}_{n + 1}}{\partial{\overset{\rightarrow}{x}}_{n}} = {I + {\frac{1}{6}\begin{pmatrix} \Phi_{rr} & \Phi_{rv} \\ \Phi_{vr} & \Phi_{vv} \end{pmatrix}}}} & (1.21) \end{matrix}$

where the Φ matrices have dimensions 3×3 and are defined as follows:

$\begin{matrix} \begin{matrix} {\Phi_{rr} = {{h^{2}\varphi_{1}} + {h^{2}\varphi_{2}} + {h^{2}\varphi_{3}} + {\frac{1}{4}h^{4}\varphi_{3}\varphi_{1}}}} \\ {\Phi_{rv} = {{6{hI}} + {\frac{1}{2}h^{3}\varphi_{2}} + {\frac{1}{2}h^{3}\varphi_{3}}}} \\ {\Phi_{vr} = {{h\;\varphi_{1}} + {2h\;\varphi_{2}} + {2h\;\varphi_{3}} + {h\;\varphi_{4}} + {\frac{1}{2}h^{3}\varphi_{3}\varphi_{1}} + {\frac{1}{2}h^{3}\varphi_{4}\varphi_{2}}}} \\ {\Phi_{vv} = {{h^{2}\varphi_{2}} + {h^{2}\varphi_{3}} + {h^{2}\varphi_{4}} + {\frac{1}{4}h^{4}\varphi_{4}\varphi_{3}}}} \end{matrix} & (1.22) \end{matrix}$

Matrix

$\frac{\partial{\overset{\rightarrow}{x}}_{n + 1}}{\partial{\overset{\rightarrow}{x}}_{n}}$ in equation (1.21) contains products of no more than pairs of 3×3 matrices, compared with the original expression in equation (1.16), which contained products of up to four 6×6 matrices. Note that the dimension of matrix Λ is 6×3, and therefore only two of the four 3×3 matrices are needed in the right-hand side of equation (1.21).

Rough estimates presented in one of previous sections show that the time interval between the two epochs associated with the ADR difference computation can be quite long. Even though partial derivatives (1.21) are computed to the fourth-order accuracy with respect to h, the accuracy of the result may not be sufficient for long time intervals. A natural solution to improve the accuracy would be to employ several substeps, and to compute partial derivative (1.21) as a product of matrices, which correspond to these substeps.

The φ_(k) matrices are key to computing equation (1.21). They can be computed in the case of a J2 gravitational potential:

$\begin{matrix} \begin{matrix} {\varphi_{ji} = {\frac{3\mu\; r_{i}r_{j}}{r^{5}} - \frac{{\mu\delta}_{ij}}{r^{3}} - {\frac{\mu\; J_{2}R_{E}^{2}}{2}.}}} \\ {\left\lbrack {{- \frac{30\mspace{11mu}{\left( {\overset{\rightarrow}{r} \cdot \overset{\rightarrow}{n}} \right) \cdot \left( {{n_{i}r_{j}} + {n_{j}r_{i}}} \right)}}{r^{7}}} + \frac{6n_{i}n_{j}}{r^{5}} - \frac{15r_{i}r_{j}}{r^{7}} +} \right.} \\ \left. {\frac{105\mspace{11mu}\left( {\overset{\rightarrow}{r} \cdot \overset{\rightarrow}{n}} \right)^{2}r_{i}r_{j}}{r^{9}} + \frac{3\delta_{ij}}{r^{5}} - \frac{15\mspace{11mu}\left( {\overset{\rightarrow}{r} \cdot \overset{\rightarrow}{n}} \right)^{2}\delta_{ij}}{r^{7}}} \right\rbrack \end{matrix} & (1.23) \end{matrix}$

where n={n_(i)} is the unit vector in the z direction, r=|{right arrow over (r)}|, and R_(E) is the Earth's radius.

A propagation model often includes effects other than the Earth gravitational field. Some of these effects cause (object) spacecraft acceleration, which is a function of the spacecraft position only, e.g. acceleration due to Sun and Moon, and solar radiation pressure. In this case, derivation of partials for ADR processing is analogous to that above. In some other effects (e.g., atmospheric drag), the acceleration is a function of both position and velocity. In this case, one either does not do a simplification in equations and use the full form (1.16), or treat such effects as a perturbation with a lower order accuracy.

Thus, in step 120, the φ_(k) matrix is computed for each of the Runge-Kata substeps using equation (1.23), or formulas for higher-order gravitational terms beyond J2, which are provided separately below. After the φ_(k) matrices are computed, in step 130 they are substituted into the equation set (1.22), and the results of equation set (1.22) are used in equation set (1.21) to compute the matrix Λ.

The matrix Λ is substituted into the partials equation (1.9).

1. Partials with Respect to Position and Velocity in the Earth-Fixed Frame of Reference

The previous subsection presents computation of partials in an inertial frame of reference. Since satellite positions and higher-order gravitational terms are available in the ECEF, it is necessary to compute partials in this frame. Since equation (1.9) can be directly applied to compute partials with respect to position and velocity of the object in the inertial frame, in step 140, the result of the computation in equation (1.9) is converted to ECEF using the transformation equation (1.24) below to compute partials with respect to position and velocity (for pairs of measurements).

To convert the result to ECEF, the following formula is used:

$\begin{matrix} {\frac{{\partial\Delta}\; P}{\partial x_{n,i}^{E}} = {\sum\limits_{j = 1}^{6}\;{\frac{\partial x_{n,j}^{I}}{\partial x_{n,i}^{E}} \cdot \frac{{\partial\Delta}\; P}{\partial x_{n,j}^{I}}}}} & (1.24) \end{matrix}$

where x_(n,i) ^(E) is the i-th component of the position and velocity vector in the ECEF frame at epoch n, and x_(n,j) ^(I) is the j-th component of the same vector in the inertial frame. The element

$J_{ji} = \frac{\partial x_{n,j}^{I}}{\partial x_{n,i}^{E}}$ in the Jacobian matrix J can be computed explicitly so that:

$\begin{matrix} {J = \begin{pmatrix} I & 0 \\ \vartheta & I \end{pmatrix}} & (1.25) \end{matrix}$

where

=[[{right arrow over (ω)}]], {right arrow over (ω)} is the vector of the Earth's angular velocity, and [[{right arrow over (ω)}]] is the 3×3 skew-symmetric matrix formed from {right arrow over (ω)}.

It is noted that the partials are computed first in the inertial frame. This is due to the special form of the Ψ matrix in the inertial frame in equation (1.18), which greatly simplifies the result, and makes it more economical to compute partials in the inertial frame first, and then to convert them to ECEF using equation (1.24). However, this is not a requirement, but only a convenience.

2. Partials with Respect to the Clock and Clock Drift

Some spacecraft implementations use a clock with relatively low stability. Thus, estimation of the clock error and, preferably, clock drift is necessary. In step 150, partials computed above with respect to position and velocity are augmented with partials with respect to clock and clock drift as now described.

This begins by estimating the clock drift. One of the ADR measurements in the form given by equation (1.2) is used and its derivative is taken with respect to the clock error and clock drift. The drift is assumed to be constant during the time interval between epochs n−1 and n. This produces the following partials:

$\begin{matrix} \begin{matrix} {\frac{{\partial\Delta}\; P}{\partial\tau} = {\frac{\partial}{\partial\tau}\left\{ {\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} - \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}} \right\}}} \\ {\frac{{\partial\Delta}\; P}{\partial\overset{.}{\tau}} = {h + {\frac{\partial}{\partial\overset{.}{\tau}}\left\{ {\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} - \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}} \right\}}}} \end{matrix} & (1.26) \end{matrix}$

where h is the time difference between epochs, and is by far the largest term. Thus, processing this measurement updates primarily the value of the clock drift. This update may be not very accurate if a good propagation model is not available for the clock (in one model, drift is assumed constant between epochs). Inaccuracies in estimating the clock drift will make this measurement all but useless for estimating velocity. To estimate velocity, we need a differenced measurement.

Computation of partials to estimate object velocity from difference measurements was presented above; however, not all partials have been computed. Namely, partials of the differenced measurements with respect to the object clock and clock drift remain to be derived.

The numerator of equation (1.8) does not contain the clock error or drift explicitly, yet there is an implicit dependence. The clock error at epoch n is assumed to be τ, and the clock drift is {dot over (τ)}. This means that the n-th epoch measurement was taken at a time, which differs by −τ from the integer second, and the (n−1)-th epoch measurement was taken at a time, which differs by −τ+{dot over (τ)}·h from the integer second. Since any changes in τ and {dot over (τ)} affect the time of the snapshot, they also affect the measured ADR. Computation of corresponding partial derivatives yields the following formulas:

$\begin{matrix} \begin{matrix} {\frac{\partial\begin{matrix} {\left\{ \left\lbrack {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} -} \\ \left. \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}} \right\} \end{matrix}}{\partial\tau} = {{- \frac{\left( {{\overset{\rightarrow}{v}}_{n} - {\overset{\rightarrow}{v}}_{s,n}} \right) \cdot \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)}{\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}}}} +}} \\ {\frac{\left( {{\overset{\rightarrow}{v}}_{n - 1} - {\overset{\rightarrow}{v}}_{s,{n - 1}}} \right) \cdot \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)}{\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}}} \\ {\frac{\partial\begin{matrix} {\left\{ \left\lbrack {{\overset{\rightarrow}{r}}_{n} - {\overset{\rightarrow}{r}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} -} \\ \left. \left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}} \right\} \end{matrix}}{\partial\overset{.}{\tau}} = {{- \frac{\left( {{\overset{\rightarrow}{v}}_{n - 1} - {\overset{\rightarrow}{v}}_{s,{n - 1}}} \right) \cdot \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)}{\left\lbrack \left( {{\overset{\rightarrow}{r}}_{n - 1} - {\overset{\rightarrow}{r}}_{s,{n - 1}}} \right)^{2} \right\rbrack^{\frac{1}{2}}}} \cdot h}} \end{matrix} & (1.27) \end{matrix}$

In the right-hand sides of equation (1.27), values of position and velocity may be used in either the inertial or ECEF frame, since the formulas are scalars and valid for both.

Using the result of equation (1.27), a partial matrix is created and is used in step 160 to form the Kalman filter measurement equations to generate from the ADR differences an instantaneous velocity estimate. The partial derivative equations described above are formulated in such a way that the Kalman filter produces the instantaneous velocity from the ADR differences. Thus, in step 170, this instantaneous velocity is used to update the velocity component of the state vector during the measurement phase of the Kalman filter processing as represented in step 170.

Thus, the Kalman filter will process an ADR measurement residual for a pair of ranging signal sources (e.g., GPS satellites) in the form of equation (1.7), using the corresponding partials matrix. The partials matrix comprises two partitions. The first partition is for the (object, e.g., spacecraft) position and velocity, and is defined by a difference of two terms, each corresponding to a ranging signal source (e.g., GPS satellite) and defined by the right-hand side of equation (1.9). The second partition is for the (object, e.g., spacecraft) clock and clock drift, and is defined by the right-hand sides of equation (1.27). If the spacecraft state vector includes additional components (e.g., clock acceleration, solar radiation reflection coefficient, etc.) corresponding partials can be derived and used in a similar way.

The foregoing presents a derivation of measurement equations for processing ADR data. Measurement equations for processing PR are well known in the art, and are not described herein. The Kalman filter will also process the PR measurements to update the position component of the state vector in step 170.

The ADR measurement equations set forth above are formulated in a much more accurate way so that the time interval between the ADR measurements used to compute an ADR difference can be much larger than that used for current ADR differencing techniques for GPS navigation applications. An analogy that illuminates advantages of this technique is as follows.

Consider the task of measuring a dimension (length, width or height) of a large building, such as an office building. One way to make these measurements is with a relatively short ruler. Because the ruler is short, numerous measurements are required with the ruler to complete a measurement of one dimension of the building. The measurement errors will accumulate for the plurality of measurements made with the short ruler. On the other hand, another way to make these measurements is to use a very long measurement tape. In fact, if the measurement tape is long enough, only one measurement may be needed for a dimension of the building, and a much more accurate measurement is obtained. The prior art ADR GPS navigation techniques are akin to using a short ruler to measure a significantly large distance. The measurement error accumulates for each ADR difference computation because the time interval between each ADR measurement is short (e.g., 1 sec), thus analogous to the “short ruler” problem. Such ADR measurement errors decrease the overall accuracy of the navigation computations because of their cumulative effect.

While propagation models used in Kalman filters have been developed and honed to be very accurate, this has not been the case for the equations used for ADR data. The ADR measurement equations set forth above achieve a measurement accuracy that is comparable to the accuracy achieved by many known propagation models. Thus, when updating (e.g., propagating) a state vector with new measurement data, the ADR measurement equations provide highly accurate measurement data for the propagation equations, which overall significantly improves the accuracy of the navigation computations.

Another analogy is to start a stop watch and begin traveling in a car, and after some time interval, stop the stop watch and measure the distance that the car has traveled. Each time the stop watch is started and stopped, error is introduced. If one uses a short time period, the estimate of speed will likely not be very accurate. Conversely, if the car moves at the constant speed, and if one performs a measurement over a long period of time, the estimate of speed becomes much more accurate. While the second option is preferable, it is not always feasible since the assumption of the constant speed may be invalid. In this case, measuring speed over a long time interval will only produce the average speed over this interval. The average speed is of little practical use, since most applications require knowledge of the current state.

These techniques combine the advantage of measuring the object's velocity over relatively long time intervals with the ability to accurately map such measurements to instantaneous velocity at the time of processing. This is accomplished by processing differenced ADR measurements and by applying a mathematical formulation which accurately maps such differences to the current state vector of the user.

A way of explaining the method of this invention is as follows. Note that in the car speed analogy, the distance traveled (which is similar to the ADR difference in the problem at hand) is directionally proportional to the speed of the car. Therefore, the derivative of the distance with respect to the speed of the car is equal to the time span of the measurement. The Kalman filter canonically estimates the velocity by using the measurement itself (in the car analogy, the distance traveled), and its partial derivative with respect to the unknown (in the car analogy, this derivative is the time span of the measurement). In this invention, a high-accuracy method is devised for computing the partial derivatives required by the Kalman filter, which, combined with long time span of each measurements, yields a high-accuracy velocity estimate for the object.

3. Propagation

Set forth below are the propagation equations used by the Kalman filter.

The state vector itself can be propagated using a force model and an integration routine (e.g., Runge-Kutta scheme). Again, this is well known in the art and not described-herein. Propagation of the covariance matrix is more challenging. The starting point is the partial derivative of the state vector at epoch (n+1) with respect to the state vector at epoch n. If these partial derivatives are computed, the covariance matrix can be propagated using standard formulas. The required derivatives are:

$\begin{matrix} {\Xi_{ij} = \frac{\partial x_{{n + 1},i}^{E}}{\partial x_{n,j}^{E}}} & (1.28) \end{matrix}$

The state vector has partitions for position, velocity, and clock/drift. Thus, the matrix Ξ has partitions for derivatives of position with respect to velocity, position with respect to clock, velocity with respect to position, etc. These partitions are considered separately below.

a. Derivatives which do not Involve Clock Components

Comparison with equation (1.10) shows that this matrix is similar to matrix Λ and it is assumed that computation of Λ will help in computing Ξ. However, components of the state vector in equation (1.28) are expressed in the ECEF and this requires more than just applying Λ:

$\begin{matrix} {\frac{\partial x_{{n + 1},i}^{E}}{\partial x_{n,j}^{E}} = {\sum\limits_{k,m}{\frac{\partial x_{{n + 1},i}^{E}}{\partial x_{{n + 1},k}^{I}} \cdot \frac{\partial x_{{n + 1},k}^{I}}{\partial x_{n,m}^{I}} \cdot \frac{\partial x_{n,m}^{I}}{\partial x_{n,j}^{E}}}}} & (1.29) \end{matrix}$

In equation (1.29), one recognizes that

$\frac{\partial x_{n,m}^{I}}{\partial x_{n,j}^{E}} = J_{mj}$ as defined in equation (1.25), and

$\frac{\partial x_{{n + 1},k}^{I}}{\partial x_{n,m}^{I}} = \Lambda_{k\; m}^{+}$ with expressions for Λ_(km) ⁺ given by equation (1.21). Superscript “+” indicates that in this case position and velocity are propagated forward, as opposed to backward propagation in the definition for Λ_(km) in equation (1.10). (These two cases correspond to using positive and negative values for h in equation (1.21)).

The quantity remaining to be computed is

$\frac{\partial x_{{n + 1},i}^{E}}{\partial x_{{n + 1},k}^{I}}.$ In this quantity, both the numerator and the denominator have the same time stamp, and no propagation is involved. All derivatives are due to conversions between frames of reference.

It is assumed in equation (1.29) that the inertial system has its axes aligned with ECEF axes at epoch n. It keeps the same orientation for epoch (n+1). Thus, conversion of x_(n+1,k) ^(I) to x_(n+1,i) ^(E) may be viewed as comprising two operations: conversion from the inertial frame to the ECEF frame at epoch n and then conversion from ECEF at epoch n to that at epoch (n+1). This conversion can be expressed as follows:

$\begin{matrix} {\frac{\partial x_{{n + 1},i}^{E}}{\partial x_{{n + 1},k}^{I}} = \left( {\Omega \cdot J^{- 1}} \right)_{ik}} & (1.30) \end{matrix}$

where

$\Omega = \begin{pmatrix} M & 0 \\ 0 & M \end{pmatrix}$ and M is the 3×3 rotation matrix from ECEF at epoch n to that at epoch (n+1). J⁻¹ can be formed from J by changing

to −

. Substitution of all matrices in (1.29) yields the following expression for Ξ partitions, which do not involve clock components: Ξ_(rr) =M·(Λ_(rr) ⁺+Λ_(rv) ⁺·

) Ξ_(rv) =M·Λ _(rv) ⁺ Ξ_(vr) =−M·

·(Λ_(rr) ⁺+Λ_(rv) ⁺·

)+M·(Λ_(vr) ⁺+Λ_(vv) ⁺·

) Ξ_(vv) =M·(Λ_(vv) ⁺−

·Λ_(rv) ⁺)  (1.31)

b. Derivatives of Position/Velocity with Respect to Clock/Drift

This subsection describes computations of the derivatives

$\frac{\partial{\overset{\rightarrow}{r}}_{n + 1}^{E}}{\partial\tau},\frac{\partial{\overset{\rightarrow}{v}}_{n + 1}^{E}}{\partial\tau},\frac{\partial{\overset{\rightarrow}{r}}_{n + 1}^{E}}{\partial\overset{.}{\tau}},{{and}\mspace{14mu}{\frac{\partial{\overset{\rightarrow}{v}}_{n + 1}^{E}}{\partial\overset{.}{\tau}}.}}$ When computing these derivatives, it is noted that the position/velocity at epoch n+1 depends on the position/velocity at epoch n, and the latter in turn depends on the clock error and clock drift. Thus, there is an implicit dependence of the position/velocity at epoch n+1 on the clock/drift at epoch n though position/velocity at epoch n. However, we need to compute partial derivatives, and this implicit dependence must be excluded. The result is as follows.

For conservative equations (as it is the case with satellite dynamics in the Earth gravitational field in the ECEF frame) there is no dependence on the clock error (i.e., derivatives are zero), but there is a slight dependence on the clock drift. It is given by the following formula:

$\begin{matrix} {{\frac{\partial{\overset{\rightarrow}{r}}_{n + 1}^{E}}{\partial\overset{.}{\tau}} = {{- {\overset{\rightarrow}{v}}_{n + 1}^{E}} \cdot h}}{\frac{\partial{\overset{\rightarrow}{v}}_{n + 1}^{E}}{\partial\overset{.}{\tau}} = {{- {\overset{\rightarrow}{a}}_{n + 1}^{E}} \cdot h}}} & (1.32) \end{matrix}$

where {right arrow over (a)}_(n+1) ^(E) is the object acceleration at epoch n+1 in the ECEF frame (acceleration is computed using force models).

c. Derivatives of Clock/Drift with Respect to Other Components

These are trivial and are given by the following:

$\begin{matrix} \begin{matrix} {\frac{\partial\tau_{n + 1}}{\partial{\overset{\rightarrow}{r}}_{n}^{E}} = {\frac{\partial\tau_{n + 1}}{\partial{\overset{\rightarrow}{v}}_{n}^{E}} = {\frac{\partial{\overset{.}{\tau}}_{n + 1}}{\partial{\overset{\rightarrow}{r}}_{n}^{E}} = {\frac{\partial{\overset{.}{\tau}}_{n + 1}}{\partial{\overset{\rightarrow}{v}}_{n}^{E}} = 0}}}} \\ {\frac{\partial\tau_{n + 1}}{\partial\tau_{n}} = 1} \\ {\frac{\partial{\overset{.}{\tau}}_{n + 1}}{\partial{\overset{.}{\tau}}_{n}} = 1} \\ {\frac{\partial\tau_{n + 1}}{\partial{\overset{.}{\tau}}_{n}} = h} \\ {\frac{\partial{\overset{.}{\tau}}_{n + 1}}{\partial\tau_{n}} = 0} \end{matrix} & (1.33) \end{matrix}$

4. Higher-Order Gravitational Terms

This section presents computation of matrices φ for higher-order gravitational terms. The gravitational potential of higher-order terms is typically given in polar coordinates (see, M. Kaplan, Modern Spacecraft Dynamics & Control, John Wiley & Sons, 1976):

$\begin{matrix} \begin{matrix} {{U\left( {r,\theta,\phi} \right)} = {\frac{\mu}{r}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{{P_{k}^{j}\left( {\sin\mspace{11mu}\theta} \right)} \cdot}}}}}} \\ {\left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \end{matrix} & (1.34) \end{matrix}$

Formula (1.34) differs from formula (7.16) in Kaplan as follows: it uses θ for latitude (note that it is not the polar angle), φ for longitude, and C_(k) ⁰ in place of −J_(k).

First and second partial derivatives of U with respect to polar coordinates are:

$\begin{matrix} \begin{matrix} {\frac{\partial U}{\partial r} = {{- \frac{\mu}{r^{2}}}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}\left( {k + 1} \right){{P_{k}^{j}\left( {\sin\;\theta} \right)} \cdot}}}}}} \\ {\left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \\ {\frac{\partial U}{\partial\theta} = {\frac{\mu}{r}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{{P_{k}^{\prime\; j}\left( {\sin\;\theta} \right)} \cdot \cos}\;{\theta \cdot}}}}}} \\ {\left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \\ {\frac{\partial U}{\partial\phi} = {\frac{\mu}{r}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{{P_{k}^{j}\left( {\sin\;\theta} \right)} \cdot j \cdot}}}}}} \\ {\left( {{{- C_{k}^{j}}\sin\; j\;\phi} + {S_{k}^{j}\cos\; j\;\phi}} \right)} \\ {\frac{\partial^{2}U}{\partial r^{2}} = {\frac{\mu}{r^{3}}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{\left( {k + 1} \right) \cdot \left( {k + 2} \right) \cdot {P_{k}^{j}\left( {\sin\;\theta} \right)} \cdot}}}}}} \\ {\left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \\ {\frac{\partial^{2}U}{\partial\phi^{2}} = {{- \frac{\mu}{r}}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{{P_{k}^{j}\left( {\sin\;\theta} \right)} \cdot j^{2} \cdot}}}}}} \\ {\left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \\ {\frac{\partial^{2}U}{\partial\theta^{2}} = {\frac{\mu}{r}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}\left\lbrack {{{{P_{k}^{n\; j}\left( {\sin\;\theta} \right)} \cdot {\cos\;}^{2}}\;\theta} -} \right.}}}}} \\ {\left. {{{P_{k}^{\prime\; j}\left( {\sin\;\theta} \right)} \cdot \sin}\;\theta} \right\rbrack \cdot \left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \\ {\frac{\partial^{2}U}{{\partial r}{\partial\theta}} = {{- \frac{\mu}{r^{2}}}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{\left( {k + 1} \right) \cdot {P_{k}^{\prime\; j}\left( {\sin\;\theta} \right)} \cdot \cos}\;{\theta \cdot}}}}}} \\ {\left( {{C_{k}^{j}\cos\; j\;\phi} + {S_{k}^{j}\sin\; j\;\phi}} \right)} \\ {\frac{\partial U}{{\partial\theta}{\partial\phi}} = {\frac{\mu}{r}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{{P_{k}^{\prime\; j}\left( {\sin\;\theta} \right)} \cdot \cos}\;{\theta \cdot j \cdot}}}}}} \\ {\left( {{{- C_{k}^{j}}\sin\; j\;\phi} + {S_{k}^{j}\cos\; j\;\phi}} \right)} \\ {\frac{\partial^{2}U}{{\partial r}{\partial\phi}} = {{- \frac{\mu}{r^{2}}}{\sum\limits_{k = 2}^{\infty}\;{\sum\limits_{j = 0}^{k}\;{\left( \frac{R_{E}}{r} \right)^{k}{\left( {k + 1} \right) \cdot {P_{k}^{\; j}\left( {\sin\;\theta} \right)} \cdot j \cdot}}}}}} \\ {\left( {{{- C_{k}^{j}}\sin\; j\;\phi} + {S_{k}^{j}\cos\; j\;\phi}} \right)} \end{matrix} & (1.35) \end{matrix}$

Partial derivatives with respect to Cartesian coordinates are computed as follows:

$\begin{matrix} \begin{matrix} {\frac{\partial^{2}U}{{\partial x_{i}}{\partial x_{j}}} = {{\sum\limits_{m}{\frac{\partial^{2}\rho_{m}}{{\partial x_{i}}{\partial x_{j}}} \cdot \frac{\partial U}{\partial\rho_{m}}}} + {\sum\limits_{m,n}\;{\frac{\partial\rho_{m}}{\partial x_{j}} \cdot \frac{\partial\rho_{n}}{\partial x_{i}} \cdot}}}} \\ {\frac{\partial^{2}U}{{\partial\rho_{m}}{\partial\rho_{n}}}} \end{matrix} & (1.36) \end{matrix}$

where vector {right arrow over (ρ)} is defined as {right arrow over (ρ)}={r, θ, φ}. Note that (A3) contains first- and second-order derivatives of polar coordinates with respect to Cartesian coordinates. These derivatives are given by:

$\begin{matrix} {{{\frac{\partial r}{\partial x} = \frac{x}{r}};{\frac{\partial r}{\partial y} = \frac{y}{r}};{\frac{\partial r}{\partial z} = \frac{z}{r}};}{{\frac{\partial\theta}{\partial x} = {- \frac{{zx}\;\cos^{2}\theta}{r_{\bot}^{3}}}};{\frac{\partial\theta}{\partial y} = {- \frac{{zy}\;{\cos\;}^{2}\theta}{r_{\bot}^{3}}}};{\frac{\partial\theta}{\partial z} = \frac{\cos\;\theta}{r_{\bot}}};}{{\frac{\partial\phi}{\partial x} = {- \frac{y}{r_{\bot}^{2}}}};{\frac{\partial\phi}{\partial y} = \frac{\cos\;\phi}{r_{\bot}}};{\frac{\partial\phi}{\partial z} = {- \frac{y}{r_{\bot}^{2}}}};}{{\frac{\partial^{2}r}{\partial x^{2}} = {\frac{1}{r} - \frac{x^{2}}{r^{3}}}};{\frac{\partial^{2}r}{\partial y^{2}} = {\frac{1}{r} - \frac{y^{2}}{r^{3}}}};{\frac{\partial^{2}r}{\partial z^{2}} = {\frac{1}{r} - \frac{z^{2}}{r^{3}}}};}{{\frac{\partial^{2}r}{{\partial x}{\partial y}} = {- \frac{xy}{r^{3}}}};{\frac{\partial^{2}r}{{\partial x}{\partial z}} = {- \frac{xz}{r^{3}}}};{\frac{\partial^{2}r}{{\partial z}{\partial y}} = {- \frac{zy}{r^{3}}}};}{{\frac{\partial^{2}\theta}{\partial x^{2}} = {{- \frac{z\;\cos^{2}\theta}{r_{\bot}^{3}}} + {3\frac{{zx}^{2}\cos^{2}\theta}{r_{\bot}^{5}}} + {2{\frac{{zx}\;\cos\;{\theta \cdot \sin}\;\theta}{r_{\bot}^{3}} \cdot \frac{\partial\theta}{\partial x}}}}};}{{\frac{\partial^{2}\theta}{\partial y^{2}} = {{- \frac{z\;\cos^{2}\theta}{r_{\bot}^{3}}} + {3\frac{{zy}^{2}\cos^{2}\theta}{r_{\bot}^{5}}} + {2{\frac{{zy}\;\cos\;{\theta \cdot \sin}\;\theta}{r_{\bot}^{3}} \cdot \frac{\partial\theta}{\partial y}}}}};}{{\frac{\partial^{2}\theta}{\partial z^{2}} = {2{\frac{\cos\;{\theta \cdot \sin}\;\theta}{r_{\bot}} \cdot \frac{\partial\theta}{\partial z}}}};}{\frac{\partial^{2}\theta}{{\partial x}{\partial z}} = {{{- 2}{\frac{\cos\;{\theta \cdot \sin}\;\theta}{r_{\bot}} \cdot \frac{\partial\theta}{\partial x}}} - \frac{{x \cdot \cos^{2}}\theta}{r_{\bot}^{3}}}}{\frac{\partial^{2}\theta}{{\partial y}{\partial z}} = {{{- 2}{\frac{\cos\;{\theta \cdot \sin}\;\theta}{r_{\bot}} \cdot \frac{\partial\theta}{\partial y}}} - \frac{{y \cdot \cos^{2}}\theta}{r_{\bot}^{3}}}}{\frac{\partial^{2}\theta}{{\partial x}{\partial y}} = {{2{\frac{{zy}\;\cos\;{\theta \cdot \sin}\;\theta}{r_{\bot}^{3}} \cdot \frac{\partial\theta}{\partial x}}} - {3\frac{{{zxy} \cdot \cos^{2}}\theta}{r_{\bot}^{5}}}}}{{\frac{\partial^{2}\phi}{\partial x^{2}} = \frac{2{yx}}{r_{\bot}^{4}}};}{\frac{\partial^{2}\phi}{\partial y^{2}} = {{{- \frac{\sin\;\phi}{r_{\bot}}} \cdot \frac{\partial\phi}{\partial y}} - \frac{{y \cdot \cos}\;\phi}{r_{\bot}^{3}}}}{\frac{\partial^{2}\phi}{{\partial x}{\partial y}} = {{- \frac{1}{r_{\bot}^{2}}} + {2\frac{y^{2}}{r_{\bot}^{4}}}}}{\frac{\partial^{2}\phi}{\partial z^{2}} = {\frac{\partial^{2}\phi}{{\partial z}{\partial x}} = {\frac{\partial^{2}\phi}{{\partial z}{\partial y}} = 0}}}} & (1.37) \end{matrix}$

In summary, the partials used in the Kalman filter to process ADR difference data are computed using the following methodology:

-   -   1. Convert the state vector from ECEF to an inertial frame,         which is momentarily aligned with ECEF (but not rotating).     -   2. Propagate the current state vector back one step, using the         4^(th) order Runge-Kutta scheme.     -   3. At each substep, compute φ element matrices using equation         (1.23) or formulas for higher-order gravitational terms.     -   4. Substitute these matrices into set (1.22), and the result         into set (1.21). This computes Λ.     -   5. Substitute Λ in equation (1.9) and then apply transformation         equation (1.24) to compute partials with respect to position and         velocity. Use them for pairs of measurements.     -   6. Use equation (1.26) for one single measurement and equation         (1.27) for pairs to augment partials for the clock and clock         drift components.

B. Propagating State Vector Using IMU Data for Integrated GPS-IMU Navigation

The following describes navigation algorithms for processing ADR data in integrated GPS-IMU systems. An IMU does not provide any absolute measurements of object position or velocity, and therefore can be used primarily as an aid in navigation. Actual estimation of position and velocity is still the result of processing GPS measurements. However, IMU data are important as a means of accurate propagation, which is crucial for obtaining high navigation performance, particularly where an accurate propagation model is not already available for the object of interest.

To appreciate the importance of IMU measurements, it is instructive to compare their role to that of a propagation model in space applications. To obtain good accuracy in spacecraft navigation applications, a sophisticated propagation model is vital. Its role is to ensure consistency between measurements collected over an extended period of time. A good propagation model allows setting the process noise to a correspondingly low level, which makes each past measurement from a recent history implicitly contribute to the current estimate almost on par with any current measurement. The result is as if there were more measurements to obtain a solution at any given time. (Of course, past measurements are not applied directly at the present time; instead, the previous estimate is propagated to the current time and is weighed heavily in the solution.) For example, if a propagation model “is good” for 1000 seconds, it facilitates using roughly 1000 times more measurements than in one epoch, which should reduce the navigation error by a factor of √{square root over (1000)}≈30 times.

There is another important consideration: an error in the propagation model is typically highly correlated in time (i.e., systematic), as opposed to random error in the measurements. Systematic errors are not removed by filter averaging, and a small systematic error may cause more harm than a much larger random error. This further emphasizes a need for a good propagation model. Error sources in the propagation model must be examined and mitigated. In doing this, it should be noted that computer implementation of a mathematical model may introduce additional errors, often of a systematic kind. For example, integration of differential equations of motion for spacecraft propagation should use a higher order scheme, such as Runge-Kutta. A low order scheme (e.g., Euler's) is analogous to having an unmodeled acceleration due to errors in representing differential equations in a discrete form.

An attractive application for a good derived propagation model would be to extend methods for velocity estimation via ADR measurements to integrated GPS/IMU navigation processing. If better propagation models are developed for integrated GPS/IMU navigation systems, an extension of ADR processing to such integrated GPS/IMU navigation systems becomes possible.

In a GPS/IMU system, the IMU part of the system serves to some degree as a means of propagating a navigation solution. The following presents a high-accuracy model for propagating a solution using IMU data.

1. Observable Quantities and the State Vector

An IMU measures accelerations and rotation rates. These quantities are time derivatives of velocity and attitude parameters, and may be included in the state vector. However, there may be a significant processing cost associated with this: an IMU typically outputs data at 100 Hz to 1000 Hz, and in generally it is excessive to run the filter processing at such high rate. Instead, acceleration and rotation rate data output by an IMU are used strictly as a propagation tool.

Even when IMU data is used as a propagation tool, there is coupling between the attitude, rotation rates, acceleration, velocity and position. This coupling is due to off-diagonal elements of the covariance matrix and will be explored in detail hereinafter. It is analogous to estimating velocity from position measurements: even though position/range is the measured quantity, the velocity can be estimated because it is coupled with position via off-diagonal elements of the covariance matrix.

This approach allows for avoiding the use of acceleration and rotation rates in the state vector. Candidate parameters for inclusion in the state vector are as follows:

-   -   1. Three components of position     -   2. Three components of velocity     -   3. Object clock and clock rate     -   4. Attitude     -   5. Biases, misalignments, scaling factors and other systematic         IMU errors

The specific representation of attitude information in the state vector will be described hereinafter. For now, it is noted that attitude is fully described by three parameters.

2. Impact of IMU Measurement Errors on the Propagation

This subsection describes the effects of random IMU error sources.

Propagation is considered over some time period T (e.g., one second) using acceleration measurements a_(i), which are available at step size h (e.g., h=0.01 second). There is a total of

$N = \frac{T}{h}$ acceleration measurements per epoch.

If acceleration measurement has error η_(i), the result is the error in the velocity, which can be estimated as η_(i)h. This velocity error contributes to propagation of object position during time remaining to the end of the epoch, i.e. during time interval (T−t_(i)), where t_(i)=ih. The resulting error in the position from this particular measurement is then estimated as follows: δx _(i)=η_(i) h·(T−t _(i))  (2.1)

The variance of this error can be estimated by squaring equation (2.1). Variances from all subepochs add to form the total error variance at the end of the epoch:

$\begin{matrix} {\overset{\_}{\delta\; x^{2}} = {{\sum\limits_{i}^{N}\;\overset{\_}{\delta\; x_{i}^{2}}} = {\sum\limits_{i}^{N}{\overset{\_}{\eta^{2}} \cdot h^{2} \cdot \left( {T - {ih}} \right)^{2}}}}} & (2.2) \end{matrix}$

The computation of the sum yields:

$\begin{matrix} {\overset{\_}{\delta\; x^{2}} \approx {\frac{1}{3}{\overset{\_}{\eta^{2}} \cdot h \cdot T^{3}}}} & (2.3) \end{matrix}$

Similarly, computation of error variance for velocity yields the following: δv ² = η² ·h·T  (2.4)

Accelerometer errors do not contribute to errors in object attitude.

Gyro measurement errors contribute to object position error, velocity error, and to the attitude error. If rates of rotation ρ are measured each epoch with error δρ_(i), then errors in attitude, position and velocity are given by:

$\begin{matrix} {\overset{\_}{\delta\; C^{2}} = {\overset{\_}{{\delta\rho}^{2}} \cdot h \cdot T}} & (2.5) \\ {\overset{\_}{\delta\; x^{2}} = {\frac{1}{20}{\overset{\_}{{\delta\rho}^{2}} \cdot h \cdot a^{2} \cdot T^{5}}}} & (2.6) \\ {\overset{\_}{\delta\; v^{2}} = {\frac{1}{3}{\overset{\_}{{\delta\rho}^{2}} \cdot h \cdot T^{3}}}} & (2.7) \end{matrix}$

where a is the object acceleration during this epoch (it varies with time, but for the purposes of computing the error variance the acceleration at any point during the epoch, e.g. in the beginning, can be used), and where the error in the position and velocity is non-zero in the directions perpendicular to the acceleration.

As mentioned above, this is a random error, and it can be accounted for by applying process noise to propagated position, velocity and attitude. Biases, misalignments, scaling factors and other systematic errors are treated separately.

3. Measurement Update

Measurement update equations process PR GPS measurements and optionally ADR measurements. The PR measurement update equations are well known in the art, and are therefore not described herein. The ADR measurement update equations are the same as those presented above for GPS-only navigation. The only non-zero components of the measurement matrix are those corresponding to position and the clock bias.

For ADR measurements, differencing or adaptive methods are used for estimating velocity. In the method described herein, ADR measurements are differenced in time to cancel the bias. To achieve the full potential, the ADR differencing is performed over time intervals which span multiple epochs, as described above for GPS-only navigation.

To process a time-differenced ADR measurement as by a Kalman filter, the observation matrix (H) involving partial derivatives of the measurement with respect to the state vector components, is computed:

$\begin{matrix} {{H \equiv \frac{{\partial\Delta}\;{ADR}}{\partial\overset{\rightarrow}{X}}} = \frac{\partial\left\{ {\left\lbrack \left( {{\overset{\rightarrow}{x}}_{n} - {\overset{\rightarrow}{x}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} - \left\lbrack \left( {{\overset{\rightarrow}{x}}_{n - M} - {\overset{\rightarrow}{x}}_{s,{n - M}}} \right)^{2} \right\rbrack^{\frac{1}{2}}} \right\}}{\partial\overset{\rightarrow}{X}}} & (2.8) \end{matrix}$

where {right arrow over (X)} is the object state vector comprising position, velocity, attitude, and IMU error states.

As described above in connection with equations (8) and (9), since object position {right arrow over (x)}_(n) is explicitly used in equation (2.8), it creates an impression that we just have to compute partials with respect to it; however object state {right arrow over (X)}_(n) is the result of the state vector propagation from epoch n−M. Thus, {right arrow over (X)}_(n) is a function of {right arrow over (X)}_(n−M); hence {right arrow over (X)}_(n−M) is an (inverse) function of {right arrow over (X)}_(n), and {right arrow over (x)}_(n−M) (being a part of {right arrow over (X)}_(n−M)) is a function of {right arrow over (X)}_(n). This results in a more complex computation of the derivatives:

$\begin{matrix} {\begin{matrix} {{\frac{\partial}{\partial{\overset{->}{X}}_{n}}\begin{Bmatrix} {\left\lbrack \left( {{\overset{->}{x}}_{n} - {\overset{->}{x}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}} -} \\ \left\lbrack \left( {{\overset{->}{x}}_{n - M} - {\overset{->}{x}}_{s,{n - M}}} \right)^{2} \right\rbrack^{\frac{1}{2}} \end{Bmatrix}} = {\frac{\chi\mspace{11mu}\left( {{\overset{->}{X}}_{n} - {\overset{->}{X}}_{s,n}} \right)}{\left\lbrack \left( {{\overset{->}{x}}_{n} - {\overset{->}{x}}_{s,n}} \right)^{2} \right\rbrack^{\frac{1}{2}}} -}} \\ {\frac{\left\lbrack {\Lambda^{T}\left( {{\overset{->}{x}}_{n - M} - {\overset{->}{x}}_{s,{n - M}}} \right)} \right\rbrack}{\left\lbrack \left( {{\overset{->}{x}}_{n - M} - {\overset{->}{x}}_{s,{n - M}}} \right)^{2} \right\rbrack^{\frac{1}{2}}}} \end{matrix}{where}} & (2.9) \\ {\Lambda_{if} \equiv \frac{\partial x_{{n - M},i}}{\partial X_{n,j}}} & (2.10) \end{matrix}$

and χ contains all zeroes, except for the first three elements of the main diagonal which are equal to 1.

4. Propagation

a. Forward Propagation

Forward propagation algorithms are needed for both the state vector and the covariance matrix. With reference to FIG. 6, a method for using IMU data to propagate a state vector computed from PR measurements and ADR differences will be described. In step 200, the observation matrix H is computed from the state vector as indicated in equation 2.10.

i. Propagation of Attitude

Next, in step 210, the attitude component is propagated by propagating a rotation matrix C(t) that transforms a vector from the IMU body axes to the ECI coordinate system. The goal is to derive a propagation algorithm for this matrix, which uses the gyro sensor data.

At each subepoch, matrix C(t) undergoes a small change. This change is due to rotation of the IMU during this subepoch, the rate of which is measured by the gyro in the body system of reference. Thus, if matrix C(t+dt) is needed to transform a vector from the body system to ECI at time (t+dt), it can be done by applying two consecutive steps:

1. Rotate from the body system at time (t+dt) to that at time t

2. Rotate from the body system at time t to ECI by applying matrix C(t)

The first rotation is small, and therefore all three angle rotations are commutative. It is the inverse of the rotation from the body system at time t to that at time (t+dt), which is in the form:

$\begin{matrix} {{\delta\mspace{11mu} C\mspace{11mu}(t)} = {\begin{pmatrix} 1 & {{dt}\;\rho_{3}} & {{- {dt}}\;\rho_{2}} \\ {{- {dt}}\;\rho_{3}} & 1 & {{dt}\;\rho_{1}} \\ {{dt}\;\rho_{2}} & {{- {dt}}\;\rho_{1}} & 1 \end{pmatrix} = {\hat{I} + {\hat{\rho}\mspace{11mu}{(t) \cdot {dt}}}}}} & (2.11) \end{matrix}$

where matrix {circumflex over (ρ)}=[[{right arrow over (ρ)}]] is a skew-symmetric matrix formed from a three-component vector of rotation rates as measured by the gyro. The inverse of this matrix is simply the same matrix, but with a minus sign after Î. Thus, propagation of matrix C(t) is described by: C(t+dt)=C(t)·(Î−{circumflex over (ρ)}·dt)  (2.12)

This formula would be perfectly fine if propagation is needed over an infinitesimally short time interval dt. However, it is modified to propagate it over one epoch (e.g., 1 second). A simple generalization yields:

$\begin{matrix} {{C\mspace{11mu}\left( {t + T} \right)} = {C\mspace{11mu}{(t) \cdot {\prod\limits_{j}\;\left( {\hat{I} - {\hat{\rho}\mspace{11mu}{\left( t_{j} \right) \cdot {dt}}}} \right)}}}} & (2.13) \end{matrix}$

where the order of matrix multiplication is such that later subepochs correspond to the rightmost multipliers in the product. (This expression is closely related to Volterra multiplicative integral.) This propagation scheme has the first order accuracy at each step (i.e., the error of the order of o(dt²)) and the error of the order of o(dt) after propagation over the entire epoch.

In applications where high accuracy is not required, this simple generalization may be sufficient; yet there is room for further improvement. First, the second-order propagation is sought at each step.

Second-order Propagation Scheme for Rotation Matrix

The first step is to centralize the propagation scheme. (In fact, if an additive integral is propagated rather than a multiplicative integral, this would be that is needed.) For brevity, let subscript 0 refer to time t, and subscript 1 refer to time (t+dt). Then, a propagation scheme is sought in the following form:

$\begin{matrix} {C_{1} = {{C_{0} \cdot \left( {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{0} + {\hat{\rho}}_{1}} \right) \cdot {dt}}}} \right)} + {o\mspace{11mu}\left( {dt}^{2} \right)}}} & (2.14) \end{matrix}$

where C₁ is the exact value of rotation matrix at time (t+dt). All differences between the exact propagation and our formula are accounted for by the o(dt²) term.

First consider propagation over two consecutive time intervals. There are two ways to do this: one step 2dt long, or two steps dt each. Since the exact rotation matrix is computed, the results must match:

$\begin{matrix} {{C_{2} = {{C_{0} \cdot \left( {\hat{I} - {\frac{1}{2}\;{\left( {{\hat{\rho}}_{0} + {\hat{\rho}}_{2}} \right) \cdot 2}\;{dt}}} \right)} + {4\; o\mspace{11mu}\left( {dt}^{2} \right)}}}{C_{2} = {{C_{0} \cdot \left( {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{0} + {\hat{\rho}}_{1}} \right) \cdot \;{dt}}}} \right) \cdot \left( {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{1} + {\hat{\rho}}_{2}} \right) \cdot {dt}}}} \right)} + {2\; o\mspace{11mu}\left( {dt}^{2} \right)}}}} & (2.15) \end{matrix}$

Note that in the first case the error o(dt²) increased by a factor of 4 compared to the single dt formula. This is because o(dt²) has quadratic dependence on dt, and dt is now two times larger. In the second case, the error increased by a factor of 2 compared to the single dt formula. This is because the same error is obtained twice by applying the propagation twice.

After using Taylor expansion for {circumflex over (p)}₁, the second equation in (2.15) can be approximated as follows:

$\begin{matrix} {C_{2} = {{C_{0} \cdot \left( {\hat{I} - {{\hat{\rho}}_{0}{dt}} - {\frac{1}{2}{{\overset{.}{\hat{\rho}}}_{0} \cdot {dt}^{2}}}} \right) \cdot \left( {\hat{I} - {{\;\hat{\rho}}_{2}{dt}} + {\frac{1}{\; 2}{{\;\overset{.}{\;\hat{\rho}}}_{2} \cdot {dt}^{\; 2}}}} \right)} + {2\; o\mspace{11mu}\left( {dt}^{\; 2} \right)}}} & (2.16) \end{matrix}$

Now, the product in equation (2.16) can be computed and the result equated to the first equation in (2.15). The result is as follows (to the second order of accuracy with respect to dt):

$\begin{matrix} {{o\mspace{11mu}\left( {dt}^{2} \right)} = {\frac{{dt}^{2}}{2}{C_{0} \cdot {\hat{\rho}}_{0} \cdot {\hat{\rho}}_{2}}}} & (2.17) \end{matrix}$

This estimate can be substituted in equation (2.14) for the final result, accurate to the second order with respect to dt:

$\begin{matrix} {C_{1} = {{C_{0} \cdot \left( {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{0} + {\hat{\rho}}_{1}} \right) \cdot {dt}}} + {\frac{1}{2}{{\hat{\rho}}_{0} \cdot {\hat{\rho}}_{1} \cdot {dt}^{2}}}} \right)} + {o\mspace{11mu}\left( {dt}^{3} \right)}}} & (2.18) \end{matrix}$

Third-Order Propagation Scheme for Rotation Matrix

The same technique can be repeated to obtain a formula valid to the third order with respect to dt. Equations for the rotation matrix after one step 2dt long, and after two steps dt each are as follows:

$\begin{matrix} {{C_{2} = {{C_{0} \cdot \left( {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{0} + {\hat{\rho}}_{2}} \right) \cdot 2}\;{dt}} + {2{{\hat{\rho}}_{0} \cdot {\hat{\rho}}_{2}}{dt}^{2}}} \right)} + {8\; o\mspace{11mu}\left( {dt}^{3} \right)}}}\;{C_{2} = {{C_{0} \cdot \left( {\hat{I} - {\frac{1}{\; 2}\;{\left( {{\hat{\rho}}_{0}\; + \;{\;\hat{\rho}}_{1}} \right) \cdot {dt}}} + {\frac{1}{\; 2}{\;\;}{{\hat{\rho}}_{0} \cdot {\hat{\rho}}_{1}}\;{dt}^{\; 2}}} \right) \cdot \left( {\hat{I}\; - {\frac{1}{\; 2}\;{\left( {{\hat{\rho}}_{1} + {\hat{\rho}}_{2}} \right) \cdot {dt}}} + {\frac{1}{\; 2}\;{{\hat{\rho}}_{1} \cdot {\hat{\rho}}_{2}}\;{dt}^{\; 2}}} \right)} + {2\; o\;\left( \;{dt}^{\; 3} \right)}}}} & (2.19) \end{matrix}$

After similar algebra, we obtain:

$\begin{matrix} {{o\mspace{11mu}\left( {dt}^{3} \right)} = {\frac{{dt}^{3}}{6}\begin{bmatrix} {{\frac{1}{4}\mspace{11mu}\left( {{\overset{¨}{\hat{\rho}}}_{0} + {\overset{¨}{\hat{\rho}}}_{2}} \right)} - {\frac{1}{2}{{\hat{\rho}}_{0}\left( {{\hat{\rho}}_{0} + {\hat{\rho}}_{2}} \right)}{\hat{\rho}}_{2}} +} \\ \left( {{{\overset{.}{\hat{\rho}}}_{0} \cdot {\hat{\rho}}_{2}} - {{\hat{\rho}}_{0} \cdot {\overset{.}{\hat{\rho}}}_{2}}} \right) \end{bmatrix}}} & (2.20) \end{matrix}$

Thus, the third-order scheme for propagating the rotation matrix is as follows: Ĉ(t _(n))=Ĉ(t _(n−1))·δĈ(t _(n−1))  (2.21)

where:

$\begin{matrix} {{\delta{\hat{C}\left( t_{n - 1} \right)}} = {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{n - 1} + {\hat{\rho}}_{n}} \right) \cdot {dt}}} + {\frac{1}{2}{{\hat{\rho}}_{n - 1} \cdot {\hat{\rho}}_{n} \cdot {dt}^{2}}} + {\frac{\mathbb{d}t^{3}}{6}{\quad\left\lbrack {{\frac{1}{4}\left( {{\overset{¨}{\hat{\rho}}}_{n - 1} + {\overset{¨}{\hat{\rho}}}_{n}} \right)} - {\frac{1}{2}{{\hat{\rho}}_{n - 1}\left( {{\hat{\rho}}_{n - 1} + {\hat{\rho}}_{n}} \right)}{\hat{\rho}}_{n}} + \left( {{{\overset{.}{\hat{\rho}}}_{n - 1} \cdot {\hat{\rho}}_{n}} - {{\hat{\rho}}_{n - 1} \cdot \overset{.}{\hat{\rho}}}} \right)} \right\rbrack}}}} & (2.22) \end{matrix}$

ii. Propagation of Position and Velocity

In step 220, the propagation algorithms described above are extended to position and velocity. Propagation involves integration over time, using higher order integration schemes, of an expression that contains the attitude matrix.

The integration is represented as a finite sum, and a scheme is derived that is valid to the second order of accuracy at each step. This requires computation of the attitude matrix to the third order for each step. Indeed, the number of steps preceding the current one is inversely proportional to the step size. Thus, the error in the attitude matrix may accumulate to become of the second order with respect to the step size, which would be consistent with the rest of the scheme. Yet, this consideration does not apply for the approximation of the attitude matrix within the step size for the purposes of derivation a formula for position, where a second-order scheme could be applied.

The following is a derivation for position propagation; a formula for velocity can be derived similarly, and with somewhat less effort.

Position at the end of an epoch (which contains N subepochs) is given by:

$\begin{matrix} {\underset{\_}{\overset{\rightarrow}{x}} = {{\overset{\rightarrow}{x}}_{0} + {{\overset{\rightarrow}{V}}_{0} \cdot T} + {\int_{t_{0}}^{t_{N}}{\int_{t_{0}}^{t}{{{\hat{C}(\tau)} \cdot {\overset{\rightarrow}{a}(\tau)}}\ {\mathbb{d}\tau}\ {\mathbb{d}t}}}}}} & (2.23) \end{matrix}$

where {right arrow over (x)}₀, {right arrow over (V)}₀ are position and velocity at the beginning of the epoch, and {right arrow over (a)}( . . . ) is the acceleration in the body coordinates as measured by the accelerometer. Integration by parts simplifies the above formula to a single integral:

$\begin{matrix} {\underset{\_}{\overset{\rightarrow}{x}} = {{\overset{\rightarrow}{x}}_{0} + {{\overset{\rightarrow}{V}}_{0} \cdot T} + {\int_{t_{0}}^{t_{N}}{{{\hat{C}(t)} \cdot {\overset{\rightarrow}{a}(t)} \cdot \left( {T - t} \right)}\ {\mathbb{d}t}}}}} & (2.24) \end{matrix}$

The goal is to compute this integral. The trapezoid method may be used for approximating the integral by a finite sum. Each step will make the following contribution:

$\begin{matrix} {{\int_{t_{n - 1}}^{t_{n}}{{{\hat{C}(t)} \cdot {\overset{\rightarrow}{a}(t)} \cdot \left( {T - t} \right)}\ {\mathbb{d}t}}} = {{\frac{\mathbb{d}t}{2} \cdot \left\lbrack {{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n - 1} \right)} \cdot \left( {T - t_{n - 1}} \right)} + {{\hat{C}\left( t_{n} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n} \right)} \cdot \left( {T - t_{n}} \right)}} \right\rbrack} + {o\left( {\mathbb{d}t^{3}} \right)}}} & (2.25) \end{matrix}$

Note that this is an exact formula; all errors in the trapezoid method are incorporated in the o(dt²) term. A similar formula can be derived for velocity propagation; it only differs from (2.25) by the absence of multipliers (T−t_(n−1)) and (T−t_(n))

Ĉ(t_(n−1)) is assumed to be already propagated to time t_(n−1) using the third-order scheme (which may produce a second-order error over n−1 subepochs). For the purposes of this derivation only, the update to the attitude matrix at time t_(n) can be estimated from that at time t_(n−1) using the second-order scheme:

$\begin{matrix} {C_{n} = {{C_{n - 1} \cdot \left( {\hat{I} - {\frac{1}{2}{\left( {{\hat{\rho}}_{n - 1} + {\hat{\rho}}_{n}} \right) \cdot {dt}}} + {\frac{1}{2}{{\hat{\rho}}_{n - 1} \cdot {\hat{\rho}}_{n} \cdot {dt}^{2}}}} \right)} + {o\left( {dt}^{3} \right)}}} & (2.26) \end{matrix}$

The rest of the derivation is as follows: equation (2.26) is substituted in equation (2.25), and the resulting formula is applied to two cases: a single propagation over one step, or two subsequent half-step propagations. The results should be identical (since formula (2.25) is exact). After some algebra, this produces an equation for o(dt²), which yields the following:

$\begin{matrix} {{\int_{t_{n - 1}}^{t_{n}}{{{\hat{C}(t)} \cdot {\overset{\rightarrow}{a}(t)} \cdot \left( {T - t} \right)}\ {\mathbb{d}t}}} = {{\frac{\mathbb{d}t}{2} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot \left\lbrack {{\left( {T - t_{n - 1}} \right) \cdot {\overset{\rightarrow}{a}\left( t_{n - 1} \right)}} + {{\left( {T - t_{n}} \right) \cdot \delta}{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n} \right)}}}} \right\rbrack} + {\frac{\mathbb{d}t^{3}}{6} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot {\quad{\left\lbrack {{\left( {T - {{\quad\quad}t}} \right) \cdot \left( {{\frac{1}{2}{\overset{.}{\hat{\rho}} \cdot \overset{\rightarrow}{a}}} + {\hat{\rho} \cdot \overset{.}{\overset{\rightarrow}{a}}} - {\frac{1}{2}{{\hat{\rho}}^{2} \cdot \overset{\rightarrow}{a}}} - {\frac{1}{2}\overset{¨}{\overset{\rightarrow}{a}}}} \right)} + \left( {\overset{.}{\overset{\rightarrow}{a}} - {\hat{\rho} \cdot \overset{\rightarrow}{a}}} \right)} \right\rbrack + {o\left( {\mathbb{d}t^{4}} \right)}}}}}} & (2.27) \end{matrix}$

where values of all parameters in the higher-order term can be computed at any time moment within the (t_(n−1), t_(n)) interval (the scheme would still retain the order) and where δĈ(t_(n−1)) is derived earlier. The total increment in the position is the sum over n of the right-hand part of formula (2.27).

A similar equation for velocity propagation is as follows:

$\begin{matrix} {{\int_{t_{n - 1}}^{t_{n}}{{{\hat{C}(t)} \cdot {\overset{\rightarrow}{a}(t)}}\ {\mathbb{d}t}}} = {{\frac{\mathbb{d}t}{2} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot \left\lbrack {{\overset{\rightarrow}{a}\left( t_{n - 1} \right)} + {\delta{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n} \right)}}}} \right\rbrack} + {\frac{\mathbb{d}t^{3}}{6} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot \left\lbrack {{\frac{1}{2}{\overset{.}{\hat{\rho}} \cdot \overset{\rightarrow}{a}}} + {\hat{\rho} \cdot \overset{.}{\overset{\rightarrow}{a}}} - {\frac{1}{2}{{\hat{\rho}}^{2} \cdot \overset{\rightarrow}{a}}} - {\frac{1}{2}\overset{¨}{\overset{\rightarrow}{a}}}} \right\rbrack} + {o\left( {\mathbb{d}t^{4}} \right)}}} & (2.28) \end{matrix}$

New notations are introduced to simplify:

$\begin{matrix} {{\underset{\_}{\overset{\rightarrow}{V}} = {\sum\limits_{n}{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{\upsilon}}_{n}}}}{\underset{\_}{\overset{\rightarrow}{x}} = {\sum\limits_{n}{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{\chi}}_{n}}}}{where}} & (2.29) \\ {{{\overset{\rightarrow}{\upsilon}}_{n} = {{\frac{dt}{2} \cdot \left\lbrack {{\overset{\rightarrow}{a}\left( t_{n - 1} \right)} + {\delta{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n} \right)}}}} \right\rbrack} + {\frac{{dt}^{3}}{6} \cdot \left\lbrack {{\frac{1}{2}{\overset{.}{\hat{\rho}} \cdot \overset{\rightarrow}{a}}} + {\hat{\rho} \cdot \overset{.}{\overset{\rightarrow}{a}}} - {\frac{1}{2}{{\hat{\rho}}^{2} \cdot \overset{\rightarrow}{a}}} - {\frac{1}{2}\overset{¨}{\overset{\rightarrow}{a}}}} \right\rbrack}}}{{\overset{\rightarrow}{\chi}}_{n} = {{\left( {T - t_{n}} \right) \cdot {\overset{\rightarrow}{\upsilon}}_{n}} + {\overset{\rightarrow}{\kappa}}_{n}}}{{\overset{\rightarrow}{\kappa}}_{n} = {{\frac{{dt}^{2}}{2} \cdot {\overset{\rightarrow}{a}\left( t_{n - 1} \right)}} + {\frac{{dt}^{3}}{6} \cdot \left( {\overset{.}{\overset{\rightarrow}{a}} - {\hat{\rho} \cdot \overset{\rightarrow}{a}}} \right)}}}} & (2.30) \end{matrix}$

iii. Misalignments

So far, treatment of IMU errors is limited to accounting for misalignments in the gyro sensor. As noted in the brackets, this is a difficult error to model. In step 230, a vector {right arrow over (S)}, as described below, is defined that characterizes the misalignment and biases in the IMU sensor into the Kalman filter state vector, and corresponding derivatives are computed.

If the IMU gyro sensor is misaligned, the measured rotation rates are different from the true rotation rates in the body frame of reference. The model which describes this effect is as follows: {right arrow over (ρ)}_(t) ={circumflex over (M)}·{right arrow over (ρ)}  (2.31)

where {right arrow over (ρ)}_(t) is the true vector of rotation rates in the body frame, {right arrow over (p)} is the measured (output) vector, and {circumflex over (M)} is some matrix, which rotates {right arrow over (p)} into {right arrow over (p)}_(t). As before, matrix {circumflex over (p)} is defined by {circumflex over (ρ)}=[[{right arrow over (ρ)}]]. The matrix {circumflex over (M)} is rotational and close to identity matrix, and therefore can be represented in the form:

$\begin{matrix} {\hat{M} = {\hat{I} + \hat{S} + {\frac{1}{2}{\hat{S}}^{2}}}} & (2.32) \end{matrix}$

where Ŝ=[[{right arrow over (s)}]], and vector {right arrow over (S)} characterizes three misalignment parameters. These parameters are generally unknown in the beginning of a navigation application and thus should be estimated.

To incorporate this model in the navigation algorithm, the following are performed:

-   -   1. Include vector {right arrow over (S)} in the Kalman filter         state vector and compute the corresponding partial derivatives.     -   2. Propagate the state vector with corrected gyro rates by         applying formulas (2.31) and (2.32) prior to using {right arrow         over (ρ)} in propagation equations.     -   3. Estimate misalignment parameters. They are assumed to be         stationary.

To reach item (3), the propagation matrix is computed, which contains partial derivatives of the position and velocity with respect to misalignment parameters. Also, a similar computation is applied to compute partial derivatives of a measurement with respect to these parameters.

The computation of partial derivatives is as follows. Defined are

$\begin{matrix} {{{\hat{G}\left( {\overset{\rightarrow}{\rho}}_{t} \right)} = \frac{\partial{\hat{\rho}}_{t}}{\partial\overset{\rightarrow}{S}}}{{\hat{F}\left( {{\overset{\rightarrow}{\rho}}_{t\; 1},{\overset{\rightarrow}{\rho}}_{t\; 2}} \right)} = {\frac{{\partial{\hat{\rho}}_{t\; 1}} \cdot {\hat{\rho}}_{t\; 2}}{\partial\overset{\rightarrow}{S}} = {{{\hat{G}\left( {\overset{\rightarrow}{\rho}}_{t\; 1} \right)} \cdot {\hat{\rho}}_{t\; 2}} + {{\hat{\rho}}_{t\; 1} \cdot {\hat{G}\left( {\overset{\rightarrow}{\rho}}_{t\; 2} \right)}}}}}{{\hat{H}\left( {{\overset{\rightarrow}{\rho}}_{t\; 1},{\overset{\rightarrow}{\rho}}_{t\; 2},{\overset{\rightarrow}{\rho}}_{t\; 3}} \right)} = {\frac{{\partial{\hat{\rho}}_{t\; 1}} \cdot {\hat{\rho}}_{t\; 2} \cdot {\hat{\rho}}_{t\; 3}}{\partial\overset{\rightarrow}{S}} = {{{\hat{F}\left( {{\overset{\rightarrow}{\rho}}_{t\; 1},{\hat{\rho}}_{t\; 2}} \right)} \cdot {\hat{\rho}}_{t\; 3}} + {{\hat{\rho}}_{t\; 1} \cdot {\hat{\rho}}_{t\; 2} \cdot {\hat{G}\left( {\overset{\rightarrow}{\rho}}_{t\; 3} \right)}}}}}} & (2.33) \end{matrix}$

and general formulas for Ĝ({right arrow over (ρ)}_(t)) are derived, where any {right arrow over (ρ)}_(t), {right arrow over ({dot over (ρ)}_(t), etc., can be plugged in. Then, these building blocks are used to find the desired partial derivatives.

A derivation for Ĝ({right arrow over (ρ)}_(t)) is presented hereinafter, which results in the following:

$\begin{matrix} {{{\hat{G}}_{jik}\left( {\overset{\rightarrow}{\rho}}_{t} \right)} = {\frac{\partial{\hat{\rho}}_{tik}}{\partial S_{j}} = {{\delta_{jk}\rho_{i}} - {\delta_{ij}\rho_{k}} + {\frac{1}{2}\left\{ {{\delta_{ij} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{k}} + {S_{i}\rho_{kj}} - {\delta_{kj} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{k}} - {S_{k}\rho_{ij}}} \right\}}}}} & (2.34) \end{matrix}$

Note that the right-hand part of formula (2.34) contains rotation rates ρ, which are not corrected for the misalignments (hence do not have the subscript t). This is because derivation of formula (2.34) accounts for misalignment corrections explicitly.

For derivatives of the attitude matrix, the following recursive formula is provided (where all {circumflex over (p)} and their derivatives below stand for values, which are already corrected for misalignments):

$\begin{matrix} {\frac{\partial{\hat{C}\left( t_{n} \right)}}{\partial\overset{->}{S}} = {{{\frac{\partial{\hat{C}\left( t_{n - 1} \right)}}{\partial\overset{->}{S}} \cdot \delta}{\hat{C}\left( t_{n - 1} \right)}} + {{\hat{C}\left( t_{n - 1} \right)} \cdot \frac{{\partial\delta}{\hat{C}\left( t_{n - 1} \right)}}{\partial\overset{->}{S}}}}} & (2.35) \end{matrix}$

or equivalently:

$\begin{matrix} {{\frac{\partial{\hat{C}\left( t_{n - 1} \right)}}{\partial\overset{->}{S}} = {{{\frac{\partial{\hat{C}\left( t_{n - 2} \right)}}{\partial\overset{->}{S}} \cdot \delta}{\hat{C}\left( t_{n - 2} \right)}} + {{\hat{C}\left( t_{n - 2} \right)} \cdot \frac{{\partial\delta}{\hat{C}\left( t_{n - 2} \right)}}{\partial\overset{->}{S}}}}}{where}} & (2.36) \\ \begin{matrix} {\frac{{\partial\delta}{\hat{C}\left( t_{n - 1} \right)}}{\partial\overset{->}{S}} = {{{- \frac{1}{2}}{\left( {{\hat{G}\left( {\hat{\rho}}_{n - 1} \right)} + {\hat{G}\left( {\hat{\rho}}_{n} \right)}} \right) \cdot {dt}}} + {\frac{1}{2}{{\hat{F}\left( {{\hat{\rho}}_{n - 1},{\hat{\rho}}_{n}} \right)} \cdot}}}} \\ {{dt}^{2} + {\frac{{dt}^{3}}{6}\left\lbrack {{\frac{1}{4}\left( {{\hat{G}\left( {\overset{\overset{¨}{\hat{}}}{\rho}}_{n - 1} \right)} + {\hat{G}\left( {\overset{\overset{¨}{\hat{}}}{\rho}}_{n} \right)}} \right)} -} \right.}} \\ {{\frac{1}{2}{\hat{H}\left( {{\hat{\rho}}_{n - 1},{\hat{\rho}}_{n - 1},{\hat{\rho}}_{n}} \right)}} -} \\ {{\frac{1}{2}{\hat{H}\left( {{\hat{\rho}}_{n - 1},{\hat{\rho}}_{n},{\hat{\rho}}_{n}} \right)}} +} \\ \left. \left( {{\hat{F}\left( {{\overset{\overset{\cdot}{\hat{}}}{\rho}}_{n - 1},{\hat{\rho}}_{n}} \right)} - {\hat{F}\left( {{\hat{\rho}}_{n - 1},{\overset{\overset{.}{\hat{}}}{P}}_{n}} \right)}} \right) \right\rbrack \end{matrix} & (2.37) \end{matrix}$

For derivatives of the position and velocity:

$\begin{matrix} {{\frac{\partial\underset{\_}{\overset{->}{V}}}{\partial\overset{->}{S}} = {\sum\limits_{n}{\hat{v}}_{n}}}{\frac{\partial\underset{\_}{\overset{->}{x}}}{\partial\overset{->}{S}} = {\sum\limits_{n}\begin{Bmatrix} {{\left( {T - t_{n}} \right) \cdot {\hat{v}}_{n}} + {\frac{\partial{\hat{C}\left( t_{n - 1} \right)}}{\partial\overset{->}{S}} \cdot {\overset{->}{\kappa}}_{n}} -} \\ {\frac{{dt}^{3}}{6} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot {\hat{G}\left( \hat{\rho} \right)} \cdot \overset{->}{a}} \end{Bmatrix}}}{Where}} & (2.38) \\ {{\hat{v}}_{n} = \begin{matrix} {{\frac{{\partial\hat{C}}\left( t_{n - 1} \right)}{\partial\overset{->}{S}} \cdot {\overset{->}{\upsilon}}_{n}} + {{\frac{dt}{2} \cdot \hat{C}}{\left( t_{n - 1} \right) \cdot}}} \\ {{\frac{{\partial\delta}{\hat{C}\left( t_{n - 1} \right)}}{\partial\overset{->}{S}} \cdot {\overset{->}{a}\left( t_{n} \right)}} + {{\frac{{dt}^{3}}{6} \cdot \hat{C}}{\left( t_{n - 1} \right) \cdot}}} \\ \left\lbrack {{\frac{1}{2}{{\hat{G}\left( \overset{.}{\hat{\rho}} \right)} \cdot \overset{\overset{.}{->}}{a}}} + {{\hat{G}\left( \hat{\rho} \right)} \cdot \overset{\overset{.}{->}}{a}} - {\frac{1}{2}{{\hat{F}\left( {\hat{\rho},\hat{\rho}} \right)} \cdot \overset{->}{a}}}} \right\rbrack \end{matrix}} & (2.39) \end{matrix}$

iv. Forward Propagation Matrix

The next step, 240, is to derive a propagation matrix. Partial derivatives of the state vector are computed at the end of an epoch with respect to the state vector at the start of the epoch.

The choice for representation of the attitude in the state vector can be deferred no longer. The attitude matrix itself is not adequate because it has 9 elements, yet is defined by only 3 independent parameters. The Euler angles have a disadvantage of exhibiting degeneration at certain values. Finally, a quaternion representation has two disadvantages: it contains 4 elements (only 3 are independent), and it requires computation of the attitude matrix at each step. Subsequent application of two quaternion rotations is not trivial. This leads us to the following choice for attitude representation: at each epoch, a small angle rotation is defined with three small Euler angles with respect to the current attitude matrix. Thus, the attitude matrix is represented in the form: Ĉ _(φ)(t)=(Î+[[{right arrow over (ω)}]])·{tilde over ({circumflex over (C)}(t)  (2.40)

where {tilde over (Ĉ)}(t) is the current estimate of the attitude, and (Î+[[{right arrow over (ω)}]]) is a small rotation in the form:

$\begin{matrix} {\left( {\hat{I} + \left\lbrack \left\lbrack \overset{->}{\varphi} \right\rbrack \right\rbrack} \right) = \begin{pmatrix} 1 & \varphi_{3} & {- \varphi_{2}} \\ {- \varphi_{3}} & 1 & \varphi_{1} \\ \varphi_{2} & {- \varphi_{1}} & 1 \end{pmatrix}} & (2.41) \end{matrix}$

Angles φ₁, φ₂, φ₃ are small, and the corresponding rotations are commutative. These angles form the attitude partition of the state vector.

A close examination of this approach reveals two potential problems:

-   -   1. After some time, error accumulation may result in φ₁, φ₂, φ₃         no longer being small. The solution to this problem is periodic         (e.g., every epoch) re-balancing of the attitude matrix and of         values of φ₁, φ₂, φ₃. Each epoch, rotation ΔĈ(t) to {tilde over         (Ĉ)}(t) is applied and thus updates the current attitude matrix,         and resets φ₁, φ₂, φ₃ to zeroes. The corresponding         transformation should also be applied to covariances of φ₁, φ₂,         φ₃. This is similar to linearizing pseudorange measurements at         each step with respect to a new, updated estimated position. The         only difference is that “linearization” for matrices is         multiplicative, rather than additive.     -   2. Successive application of small rotations may produce a         matrix, which is no longer purely rotational (e.g.,         orthonormality condition Ĉ^(T)(t)·Ĉ(t)=Î becomes inaccurate).         The solution to this problem is to periodically re-cast the         attitude matrix to an orthonormal form.

Partials are derived for propagating over one epoch in the inertial system of reference:

$\begin{matrix} {{{\overset{->}{V}}_{I,1} = {{\overset{->}{V}}_{I,0} + {\left( {\hat{I} + \left\lbrack \left\lbrack \overset{->}{\varphi} \right\rbrack \right\rbrack} \right) \cdot {\overset{\hat{\sim}}{C}}_{0} \cdot {\overset{->}{\underset{\_}{V}}}_{0}}}}{{\overset{->}{x}}_{I,1} = {{\overset{->}{x}}_{I,0} + {{\overset{->}{V}}_{I,0}T} + {\left( {\hat{I} + \left\lbrack \left\lbrack \overset{->}{\varphi} \right\rbrack \right\rbrack} \right) \cdot {\overset{\hat{\sim}}{C}}_{0} \cdot {\overset{->}{\underset{\_}{x}}}_{0}}}}{{Auxiliary}\mspace{14mu}{{computation}:\frac{\partial\varphi}{\partial S}}}} & (2.42) \\ {{\overset{\hat{\sim}}{C}}_{1} = {{\overset{\hat{\sim}}{C}}_{0} \cdot {\hat{C}}_{0}}} & (2.43) \end{matrix}$

If there is a misalignment, the final attitude matrix will differ from the nominal value:

$\begin{matrix} {{{\overset{\hat{\sim}}{C}}_{1} + {d\;{\overset{\hat{\sim}}{C}}_{1}}} = {{\overset{\hat{\sim}}{C}}_{0} \cdot \left( {{\hat{C}}_{0} + {{\frac{\partial{\hat{C}}_{0}}{\partial\overset{->}{S}} \cdot d}\;\overset{->}{S}}} \right)}} & (2.44) \end{matrix}$

On the other hand, this change in the attitude is modeled by parameters {right arrow over (ω)}: {tilde over (Ĉ)} ₁ +d{tilde over (Ĉ)} ₁=(I+[[d{right arrow over (φ)}]])·{tilde over (Ĉ)} ₁  (2.45)

Comparing (2.44) and (2.45) yields:

$\begin{matrix} {\left\lbrack \left\lbrack \frac{\partial\overset{->}{\varphi}}{\partial\overset{->}{S}} \right\rbrack \right\rbrack = {{{{\overset{\hat{\sim}}{C}}_{0} \cdot \frac{\partial{\hat{C}}_{0}}{\partial\overset{->}{S}}}{\overset{\hat{\sim}}{C}}_{1}^{T}} = {{\overset{\hat{\sim}}{C}}_{0} \cdot \frac{\partial{\hat{C}}_{0}}{\partial\overset{->}{S}} \cdot C_{0}^{T} \cdot {\overset{\hat{\sim}}{C}}_{0}^{T}}}} & (2.46) \end{matrix}$

(The right-hand side of (2.46) is a skew-symmetric matrix; this follows from

${\frac{\mathbb{d}}{\mathbb{d}\overset{->}{S}}\left( {C_{0} \cdot C_{0}^{T}} \right)} = {0.\text{)}}$

For a state vector containing position, velocity, attitude, and misalignments, partial derivatives are given by the following:

$\begin{matrix} \begin{matrix} {\frac{\partial{\overset{->}{x}}_{I,1}}{\partial{\overset{->}{x}}_{I,0}} = {\frac{\partial{\overset{->}{V}}_{I,1}}{\partial{\overset{->}{V}}_{I,0}} = {\frac{\partial{\overset{->}{\varphi}}_{I,1}}{\partial{\overset{->}{\varphi}}_{I,0}} = {\frac{\partial{\overset{->}{S}}_{I,1}}{\partial{\overset{->}{S}}_{I,0}} = \hat{I}}}}} \\ {\frac{\partial{\overset{->}{x}}_{I,1}}{\partial{\overset{->}{V}}_{I,0}} = {\hat{I} \cdot T}} \\ {\frac{\partial x_{I,1,i}}{\partial\varphi_{0,j}} = {- \left\lbrack \left\lbrack {{\overset{\hat{\sim}}{C}}_{0} \cdot {\underset{\_}{\overset{->}{x}}}_{0}} \right\rbrack \right\rbrack_{ij}}} \\ {\frac{\partial V_{I,1,i}}{\partial\varphi_{0,j}} = {- \left\lbrack \left\lbrack {{\overset{\hat{\sim}}{C}}_{0} \cdot {\underset{\_}{\overset{->}{V}}}_{0}} \right\rbrack \right\rbrack_{ij}}} \\ {\frac{\partial\left\lbrack \left\lbrack {\overset{->}{\varphi}}_{1} \right\rbrack \right\rbrack}{\partial{\overset{->}{S}}_{0}} = {{\overset{\hat{\sim}}{C}}_{0} \cdot \frac{\partial{\hat{C}}_{0}}{\partial\overset{->}{S}} \cdot C_{0}^{T} \cdot {\overset{\hat{\sim}}{C}}_{0}^{T}}} \\ {\frac{\partial{\overset{->}{V}}_{I,1}}{\partial{\overset{->}{S}}_{0}} = {\left( {\hat{I} + \left\lbrack \left\lbrack {\overset{->}{\varphi}}_{0} \right\rbrack \right\rbrack} \right) \cdot {\overset{\hat{\sim}}{C}}_{0} \cdot \frac{\partial{\overset{->}{\underset{\_}{V}}}_{0}}{\partial{\overset{->}{S}}_{0}}}} \\ {\frac{\partial{\overset{->}{x}}_{I,1}}{\partial{\overset{->}{S}}_{0}} = {\left( {\hat{I} + \left\lbrack \left\lbrack {\overset{->}{\varphi}}_{0} \right\rbrack \right\rbrack} \right) \cdot {\overset{\hat{\sim}}{C}}_{0} \cdot \frac{\partial{\overset{->}{\underset{\_}{x}}}_{0}}{\partial{\overset{->}{S}}_{0}}}} \end{matrix} & (2.47) \end{matrix}$

All other components are zero. Derivatives with respect to clock and drift are not shown, but they do not differ from formulas for a purely GPS-based navigation.

These formulas look cumbersome, but there are many opportunities to make a computation more efficient. For example, multiple products of 3×3 matrices {circumflex over (ρ)}_(i) can be simplified, some computations can be reused, etc.

This propagation matrix can be used to propagate covariances. The state vector still has to be propagated using equations (2.29) and (2.30) for position, where attitude is propagated using equations (2.21-2.22)

b. Backward Propagation

Next, in step 250, backward propagation algorithms are required to backward propagate, with a backward propagation matrix, the state vector by multiple epochs and to compute partial derivatives of the past state with respect to components of the current state. Backward propagation is used in the ADR processing.

Even though the state and covariance matrices are propagated backwards, this may not be computed by stepping in time backwards. This would require storing IMU data for the duration of the backward propagation in a stack. If the propagation time is tens of seconds, and the IMU rates are in the hundreds of Hertz, the storage and processing requirements may become excessive. Thus, a backward propagation routine is devised, that would work as going forward. In other words, backward propagation should be based on (and derived from) the forward propagation. This derivation is the subject of this subsection. The backward propagation is based on the forward propagation formulas (2.42), where values of {tilde over (Ĉ)}₀ and {right arrow over (V)} ₀, {right arrow over (x)} ₀ are computed as a function of the state at the end of the multi-epoch propagation interval.

At each epoch, values of {tilde over (Ĉ)}₀ and {right arrow over (V)} ₀, {right arrow over (x)} ₀ in (2.42) are be computed using values of misalignment parameters {right arrow over (S)}, which are valid at the end of the multiple epoch backward propagation interval. Unfortunately, during the preceding epochs, this future value is unknown. To account for such future value of {right arrow over (S)}, one should estimate the values of {tilde over (Ĉ)}₀ and {right arrow over (V)} ₀, {right arrow over (x)} ₀ for some fixed {right arrow over (S)} (e.g., {right arrow over (S)}=0) and derivatives of the same with respect to {right arrow over (S)}. When the value of {right arrow over (S)} becomes available at the end of the propagation interval, values of {tilde over (Ĉ)} and {right arrow over (V)} ₀, {right arrow over (x)} ₀ can be approximated by a two-term Taylor expansion using values at {right arrow over (S)}=0 and derivatives with respect to {right arrow over (S)}.

i. Backward Propagation Matrix

To optimally use ADR measurements, the backward propagation matrix is computed over multiple epochs. Thus, such quantities are computed, as:

$\frac{\partial{\overset{->}{x}}_{I,0}}{\partial{\overset{->}{x}}_{I,M}},\frac{\partial{\overset{->}{x}}_{I,0}}{\partial{\overset{->}{V}}_{I,M}},\frac{\partial{\overset{->}{V}}_{I,0}}{\partial{\overset{->}{x}}_{I,M}},\frac{\partial{\overset{->}{V}}_{I,0}}{\partial{\overset{->}{V}}_{I,M}},\frac{\partial x_{I,0,i}}{\partial\varphi_{I,M,j}},\frac{\partial V_{I,0,i}}{\partial\varphi_{I,M,j}},\frac{\partial{\overset{->}{V}}_{I,0}}{\partial{\overset{->}{S}}_{M}},\frac{\partial{\overset{->}{x}}_{I,0}}{\partial{\overset{->}{S}}_{M}},$ where M is the number of epochs going backwards.

To go from M−1 to M, the modified equations (2.42) are used as a starting point: {right arrow over (V)} _(1,M) ={right arrow over (V)} _(1,M−1)+(Î+[[{right arrow over (φ)}]])·{tilde over (Ĉ)} _(M−1) ·{circumflex over (V)} _(M−1) {right arrow over (x)} _(1,M) ={right arrow over (x)} _(1,M−1) +{right arrow over (V)} _(1,M−1) T+(Î+[[{right arrow over (φ)}]])·{tilde over (Ĉ)} _(M−1) ·{right arrow over (x)} _(M−1)  (2.48)

and compute partial derivatives of these formulas with respect to components of the state vector at epoch M. The state vector comprises four partitions: {right arrow over (X)}={{right arrow over (x)}₁, {right arrow over (V)}₁, {right arrow over (φ)}, {right arrow over (S)}}, where identity

$\frac{\partial{\overset{->}{X}}_{M}}{\partial{\overset{->}{X}}_{M}} = {\hat{I}.}$ The attitude matrix {tilde over (Ĉ)}_(M−1) is time-stamped at epoch M−1; hence for the purposes of derivative computation it should be considered a result of the backward propagation of the attitude matrix from epoch M to M−1. Before getting formulas for the backward propagation matrix, two auxiliary formulas are derived below.

ii. Auxiliary Computation: Derivatives of the Attitude Matrix

For the attitude matrix, the following is used: {tilde over (Ĉ)} _(M) ={tilde over (Ĉ)} _(M−1) ·{tilde over (Ĉ)} _(M−1)  (2.49)

where Ĉ_(M−1) is given by (2.21) (note that (2.21) describes propagation over one subepoch, and must be repeated multiple times to get Ĉ_(M−1), which describes propagation over one epoch). This yields:

$\begin{matrix} {{{\overset{\hat{\sim}}{C}}_{M - 1} = {{\overset{\hat{\sim}}{C}}_{M} \cdot {\hat{C}}_{M - 1}^{T}}}{and}} & (2.50) \\ {\frac{\partial{\overset{\hat{\sim}}{C}}_{M - 1}}{\partial\overset{->}{S}} = {{{\overset{\hat{\sim}}{C}}_{M} \cdot \left( \frac{\partial{\hat{C}}_{M - 1}}{\partial\overset{->}{S}} \right)^{T}} = {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot {\hat{C}}_{M - 1} \cdot \left( \frac{\partial{\hat{C}}_{M - 1}}{\partial\overset{->}{S}} \right)^{T}}}} & (2.51) \end{matrix}$

iii. Auxiliary Computation:

$\frac{\partial\varphi}{\partial S}$

This is similar to the previous computation of

$\frac{\partial\varphi}{\partial S},$ but now derivatives are computed for backward propagation using: {tilde over (Ĉ)} _(M−1) ={tilde over (Ĉ)} _(M) ·Ĉ _(M−1) ^(T)  (2.52)

If there is a misalignment, the final attitude matrix will differ from the nominal value:

$\begin{matrix} {{{\overset{\hat{\sim}}{C}}_{M - 1} + {d\;{\overset{\hat{\sim}}{C}}_{M - 1}}} = {{\overset{\hat{\sim}}{C}}_{M} \cdot \left( {{\hat{C}}_{M - 1}^{T} + {{\frac{\partial{\hat{C}}_{M - 1}^{T}}{\partial\overset{->}{S}} \cdot d}\;\overset{->}{S}}} \right)}} & (2.53) \end{matrix}$

On the other hand, this change in the attitude is modeled by parameters A: {tilde over (Ĉ)} _(M−1) +d{tilde over (Ĉ)} _(M−1)=(I+[[d{right arrow over (φ)} _(M−1)]])·{tilde over (Ĉ)} _(M−1)  (2.54)

Comparing (2.53) and (2.54) yields:

$\begin{matrix} \begin{matrix} {\frac{\partial\left\lbrack \left\lbrack {\overset{->}{\varphi}}_{M - 1} \right\rbrack \right\rbrack}{\partial\overset{->}{S}} = {{{\overset{\hat{\sim}}{C}}_{M} \cdot \frac{\partial{\hat{C}}_{M - 1}^{T}}{\partial\overset{->}{S}}}{\overset{\hat{\sim}}{C}}_{M - 1}^{T}}} \\ {= {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot {\hat{C}}_{M - 1} \cdot \frac{\partial{\hat{C}}_{M - 1}^{T}}{\partial\overset{->}{S}} \cdot {\overset{\hat{\sim}}{C}}_{0}^{T}}} \end{matrix} & (2.55) \end{matrix}$

Now the derivatives for the backward propagation matrix can be written as follows:

$\begin{matrix} \begin{matrix} {\frac{\partial{\overset{->}{x}}_{I,{M - 1}}}{\partial{\overset{->}{x}}_{I,M}} = {\frac{\partial{\overset{->}{V}}_{I,{M - 1}}}{\partial{\overset{->}{V}}_{I,M}} = {\frac{\partial{\overset{->}{\varphi}}_{I,{M - 1}}}{\partial{\overset{->}{\varphi}}_{I,M}} = {\frac{\partial{\overset{->}{S}}_{I,{M - 1}}}{\partial{\overset{->}{S}}_{I,M}} = \hat{I}}}}} \\ {\frac{\partial{\overset{->}{x}}_{I,{M - 1}}}{\partial{\overset{->}{V}}_{I,M}} = {{- \hat{I}} \cdot T}} \\ {\frac{\partial{\overset{->}{V}}_{I,{M - 1}}}{\partial{\overset{->}{\varphi}}_{M}} = \left\lbrack \left\lbrack {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot {\underset{\_}{\overset{->}{V}}}_{M - 1}} \right\rbrack \right\rbrack} \\ {\frac{\partial{\overset{->}{x}}_{I,{M - 1}}}{\partial{\overset{->}{\varphi}}_{M}} = \left\lbrack \left\lbrack {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot \left( {{\underset{\_}{\overset{->}{x}}}_{M - 1} - {T \cdot {\underset{\_}{\overset{->}{V}}}_{M - 1}}} \right)} \right\rbrack \right\rbrack} \\ {{\frac{\partial\left\lbrack \left\lbrack {\overset{->}{\varphi}}_{M - 1} \right\rbrack \right\rbrack}{\partial{\overset{->}{S}}_{M}} = {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot {\hat{C}}_{M - 1} \cdot \frac{\partial{\hat{C}}_{M - 1}^{T}}{\partial\overset{->}{S}} \cdot {\overset{\hat{\sim}}{C}}_{M - 1}^{T}}}\begin{matrix} {\frac{\partial{\overset{->}{V}}_{I,{M - 1}}}{\partial{\overset{->}{S}}_{M}} = {{{- \left( {\hat{I} + \left\lbrack \left\lbrack \overset{->}{\varphi} \right\rbrack \right\rbrack} \right)} \cdot {\overset{\hat{\sim}}{C}}_{M - 1} \cdot \frac{\partial{\overset{->}{\underset{\_}{V}}}_{M - 1}}{\partial{\overset{->}{S}}_{M - 1}}} -}} \\ {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot {\hat{C}}_{M - 1} \cdot \frac{\partial{\hat{C}}_{M - 1}^{T}}{\partial\overset{->}{S}} \cdot {\underset{\_}{\overset{->}{V}}}_{M - 1}} \end{matrix}\begin{matrix} {\frac{\partial{\overset{->}{x}}_{I,{M - 1}}}{\partial{\overset{->}{S}}_{M}} = {{{- \frac{\partial{\overset{->}{V}}_{I,{M - 1}}}{\partial{\overset{->}{S}}_{M}}} \cdot T} - {\left( {\hat{I} + \left\lbrack \left\lbrack \overset{->}{\varphi} \right\rbrack \right\rbrack} \right) \cdot {\overset{\hat{\sim}}{C}}_{M - 1} \cdot}}} \\ {\frac{\partial{\underset{\_}{\overset{->}{x}}}_{M - 1}}{\partial{\overset{->}{S}}_{M - 1}} - {{\overset{\hat{\sim}}{C}}_{M - 1} \cdot {\hat{C}}_{M - 1} \cdot \frac{\partial{\hat{C}}_{M - 1}^{T}}{\partial\overset{->}{S}} \cdot {\underset{\_}{\overset{->}{x}}}_{M - 1}}} \end{matrix}} \end{matrix} & (2.56) \end{matrix}$

All other components are zero.

Armed with these formulas, we recursive formulas for

$\frac{\partial{\overset{->}{X}}_{0}}{\partial{\overset{->}{X}}_{M}}$ can be written:

$\begin{matrix} {\frac{\partial{\overset{->}{X}}_{0}}{\partial{\overset{->}{X}}_{M}} = {\frac{\partial{\overset{->}{X}}_{0}}{\partial{\overset{->}{X}}_{M - 1}} \cdot \frac{\partial{\overset{->}{X}}_{M - 1}}{\partial{\overset{->}{X}}_{M}}}} & (2.57) \end{matrix}$

c. Backward Propagation of the State Vector

A recursive algorithm is defined: {right arrow over (υ)}_(M)={right arrow over (υ)}_(M−1) +{tilde over (Ĉ)} ₀ ^(T) ·{tilde over (Ĉ)} _(M−1) ·{right arrow over (V)} _(M−1) {right arrow over (χ)}_(M)={right arrow over (χ)}_(M−1) +T·{right arrow over (υ)} _(M−1) +{tilde over (Ĉ)} ₀ ^(T) ·{tilde over (Ĉ)} _(M−1) ·{right arrow over (x)} _(M−1)  (2.58)

where {right arrow over (υ)}₀=0, {right arrow over (χ)}₀=0. Product {tilde over (Ĉ)}₀ ^(T)·{tilde over (Ĉ)}_(M−1) is nothing more than

$\prod\limits_{m = 0}^{M - 1}\;{\hat{C}}_{m}$ product of individual matrices Ĉ_(m).

Solving the first equation of (2.58) for {tilde over (Ĉ)}_(M−1)·{right arrow over (V)} _(M−1) and substituting the result in the first equation of (2.48) yields the following: {right arrow over (V)} _(M) −{right arrow over (V)} _(M−1)=(I+[[φ]])·{tilde over (C)} ₀·({right arrow over (υ)}_(M)−{right arrow over (υ)}_(M−1))  (2.59)

Summation of (2.59) over M produces a desired backward propagation formula for {right arrow over (V)}₀: {right arrow over (V)} ₀ ={right arrow over (V)} _(M)−(I+[[φ]])·{tilde over (C)} ₀·{right arrow over (υ)}_(M)  (2.60)

Similarly, solving the second equation of (2.58) for {tilde over (Ĉ)}_(M−1)·{right arrow over (x)} _(M−1) and substituting the result in the second equation of (2.48): {right arrow over (x)} _(M) −{right arrow over (x)} _(M−1) =T·{right arrow over (V)} _(M−1)+(I+[[φ]])·{tilde over (Ĉ)} ₀·({right arrow over (χ)}_(M)−{right arrow over (χ)}_(M−1) −T·{right arrow over (υ)} _(M−1))  (2.61)

Next equation (2.60) is used, changing the subscript there from M to M−1, solving the resulting equation for {right arrow over (V)}_(M−1) and substituting in (2.61) to obtain: {right arrow over (x)} _(M) −{right arrow over (x)} _(M−1) =T·{right arrow over (V)} ₀+(I+[[φ]])·{tilde over (Ĉ)} ₀·({right arrow over (χ)}_(M)−{right arrow over (χ)}_(M−1))  (2.62)

Summation of (2.62) over M produces a desired backward propagation formula for {right arrow over (x)}₀: {right arrow over (x)} ₀ ={right arrow over (x)} _(M) −M·T·{right arrow over (V)} ₀−(I+[[φ]])·{tilde over (Ĉ)} ₀·{right arrow over (χ)}_(M)  (2.63)

Formulas (2.60) and (2.63), where {right arrow over (υ)}_(M), {right arrow over (χ)}_(M) are computed by applying (2.58), serve as a foundation of the backward propagation algorithm.

Thus, as indicated in step 260, the backward propagation matrix is used to form the Kalman filter measurement equations, and in step 270, the Kalman filter processes the PR measurements and ADR differences and updates the state vector.

C. Illustration of Navigation Performance

FIGS. 7 and 8 illustrate simulation results of navigation error (position error in meters, m, and velocity error in meters/sec, m/s) as a function of time for conventional GPS algorithms (using PR measurements only) compared with the PR+ADR processing techniques described above in conjunction with FIG. 5. The circumstances of this simulation are as follows:

A satellite in a geostationary orbit.

GPS signals received with S/N₀>27 dB·Hz. This corresponds to tracking signals in the main lobe of the GPS transmitting antenna and at the peak of the first sidelobe.

Code (PR) tracking error is Gaussian, uncorrelated, and calibrated to have 1 m standard deviation for a signal in the boresight of the GPS antenna. For weaker signals, the tracking error is scaled by 1/square root of S/N₀.

Ephemeris error is Gaussian, highly correlated in time, has a 1.4 m standard deviation for pseudorange measurements

Carrier (ADR) tracking error is Gaussian, uncorrelated, and calibrated to have standard deviation 1/100th of that for the code.

User clock has drift and random walk error with a standard deviation of 15 cm/s.

Trace 1 is the position error for conventional PR processing. Trace 2 is the position error using PR+ADR processing. Trace 3 is the velocity error for conventional PR processing. Trace 4 is the velocity error for PR+ADR processing. The improvement in the navigation error of the PR+ADR processing techniques described herein over GPS navigation using conventional PR measurement only is nearly an order of magnitude.

FIG. 8 shows a magnified portion for the first two minutes of the Plots shown in FIG. 7. In FIG. 8, ADR processing starts at t=5. The sharp drop in the velocity navigation error immediately after the start of ADR processing (trace 4) is very evident.

With regard to the GPS-IMU navigation algorithms described herein, simulations were performed under the following conditions:

IMU produces ideal data (noise and biases are zero)

Pseudorange measurements have Gaussian error with 1 m standard deviation

ADR measurements have Gaussian error with 1 cm standard deviation

FIGS. 9-10 show the results of these simulations, where the root-sum-squared (RSS) navigation errors are shown as a function of time for position (meters), velocity (m/s), and attitude (components of the attitude matrix, roughly corresponds to radians). FIG. 9 shows the errors for these parameters when only PR measurements were processed and the propagation algorithm was limited to the first order. FIG. 10 shows the error for these parameters using a second order propagation algorithm using only PR measurements. FIG. 11 shows the error for these parameters using a third order propagation algorithm for PR and ADR difference measurements. These figures show a two order of magnitude improvement in the attitude and velocity estimation and one order of magnitude improvement in the position estimation which uses ADR processing in conjunction with accurate propagation algorithms.

An accurate propagation algorithm is a key factor in enabling new methods of ADR processing for space applications. The methods described herein achieve extraordinary precision in measuring velocity of a spacecraft. Estimates for a GEO spacecraft promise achieving measurement accuracies on the order of 0.1 mm/s for each individual measurement.

Propagation equations for an integrated GPS/IMU system can be used in a similar way. Better quality of propagation allows one to use a difference in ADR measurements taken many epochs apart for greater accuracy. A difference between the space propagation and IMU-driven propagation is that in the latter case, ADR measurements would apply to estimation of velocity and attitude.

III. Miscellaneous Derivations

A. Derivation of Formula for G

Throughout this derivation, the following identities are used:

$\begin{matrix} {{{\left\lbrack \left\lbrack \overset{->}{u} \right\rbrack \right\rbrack \cdot \overset{->}{v}} = {{\hat{u} \cdot \overset{->}{v}} = {- \left\lbrack {\overset{->}{u} \times \overset{->}{v}} \right\rbrack}}}{\frac{\partial\left\lbrack {\overset{->}{u} \times \overset{->}{v}} \right\rbrack_{i}}{\partial u_{j}} = {{\left( \hat{v} \right)_{ij}\left\lbrack {\overset{->}{a} \times \left\lbrack {\overset{->}{b} \times \overset{->}{c}} \right\rbrack} \right\rbrack} = {{\overset{->}{b} \cdot \left( {\overset{->}{a} \cdot \overset{->}{c}} \right)} - {\overset{->}{c} \cdot \left( {\overset{->}{a} \cdot \overset{->}{b}} \right)}}}}} & (3.1) \end{matrix}$

1. Expression 1

First computed is:

$\begin{matrix} {\hat{A} = \frac{{\partial\left\lfloor \left\lfloor {\hat{S} \cdot \overset{->}{\rho}} \right\rfloor \right\rfloor} \cdot \overset{->}{x}}{\partial\overset{->}{S}}} & (3.2) \end{matrix}$

where {right arrow over (x)} is an arbitrary vector. Then

$\begin{matrix} \begin{matrix} {\hat{A} = {- \frac{\partial\left\lbrack {\left( {\hat{S} \cdot \overset{->}{\rho}} \right) \times \overset{->}{x}} \right\rbrack}{\partial\overset{->}{S}}}} \\ {= {\frac{\partial\left\lbrack {\overset{->}{x} \times \left( {\hat{S} \cdot \overset{->}{\rho}} \right)} \right\rbrack}{\partial\overset{->}{S}} = {- \frac{\partial\left\lbrack {\overset{->}{x} \times \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack} \right\rbrack}{\partial\overset{->}{S}}}}} \\ {= {\frac{\partial}{\partial\overset{->}{S}}\left\{ {{{- \overset{->}{S}} \cdot \left( {\overset{->}{\rho} \cdot \overset{->}{x}} \right)} + {\overset{->}{\rho} \cdot \left( {\overset{->}{S} \cdot \overset{->}{x}} \right)}} \right\}}} \end{matrix} & (3.3) \end{matrix}$

Vector {right arrow over (x)} is set equal to the k-th unit vector of the reference frame. Then derivatives can be computed as follows:

$\begin{matrix} \begin{matrix} {\frac{\partial\left\lfloor \left\lfloor {\hat{S} \cdot \overset{->}{\rho}} \right\rfloor \right\rfloor_{ik}}{\partial S_{j}} = {\frac{\partial}{\partial S_{j}}\left\{ {{{- S_{i}}\rho_{k}} + {\rho_{i}S_{k}}} \right\}}} \\ {= {{\delta_{jk}\rho_{i}} - {\delta_{ij}\rho_{k}}}} \end{matrix} & (3.4) \end{matrix}$

2. Expression 2

The next step is to compute the following expression:

$\begin{matrix} \begin{matrix} {\hat{B} = \frac{{\partial\left\lfloor \left\lfloor {{\hat{S}}^{2} \cdot \overset{->}{\rho}} \right\rfloor \right\rfloor} \cdot \overset{->}{x}}{\partial\overset{->}{S}}} \\ {= {\frac{\partial}{\partial\overset{->}{S}}\left\lbrack {\overset{->}{x} \times \left\lbrack {\overset{->}{S} \times \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack} \right\rbrack} \right\rbrack}} \\ {= {\frac{\partial}{\partial\overset{->}{S}}\left\{ {{\overset{->}{S} \cdot \left( {\overset{->}{x} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack} \right)} - {\left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack \cdot \left( {\overset{->}{x} \cdot \overset{->}{S}} \right)}} \right\}}} \end{matrix} & (3.5) \end{matrix}$

Again, {right arrow over (x)} is set equal to the k-th unit vector of the reference frame:

$\begin{matrix} {{\frac{\partial\left\lfloor \left\lfloor {{\hat{S}}^{2} \cdot \overset{->}{\rho}} \right\rfloor \right\rfloor_{ik}}{\partial\overset{->}{S}} = {\frac{\partial}{\partial\overset{->}{S}}\left\{ {{S_{i} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{k}} - {\left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{i} \cdot S_{k}}} \right\}}}{Then}} & (3.6) \\ {\frac{\partial\left\lfloor \left\lfloor {{\hat{S}}^{2} \cdot \overset{->}{\rho}} \right\rfloor \right\rfloor_{ik}}{\partial S_{j}} = {{\delta_{ij} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{k}} + {S_{i}\rho_{kj}} - {\delta_{kj} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{i}} - {S_{k}\rho_{ij}}}} & (3.7) \end{matrix}$

3. Final Expression

With these building blocks, the following is computed:

$\begin{matrix} \begin{matrix} {\frac{\partial\left( {\hat{\rho}}_{t} \right)_{ik}}{\partial S_{j}} = {\frac{\partial}{\partial S_{j}}\left\lbrack \left\lbrack {\overset{->}{\rho} + {\hat{S} \cdot \overset{->}{\rho}} + {\frac{1}{2}{{\hat{S}}^{2} \cdot \overset{->}{\rho}}}} \right\rbrack \right\rbrack}_{ik}} \\ {= {{\delta_{jk}\rho_{i}} - {\delta_{ij}\rho_{k}} + \frac{1}{2}}} \\ {\left\{ {{\delta_{ij} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{k}} + {S_{i}\rho_{kj}} - {\delta_{kj} \cdot \left\lbrack {\overset{->}{S} \times \overset{->}{\rho}} \right\rbrack_{i}} - {S_{k}\rho_{ij}}} \right\}} \end{matrix} & (3.8) \end{matrix}$

B. Derivation of x, V Propagation Formulas

Starting from

$\begin{matrix} {I_{n - 1} = {\int_{t_{n - 1}}^{t_{n}}{\left( {T - {\alpha\; t}} \right) \cdot {\hat{C}(t)} \cdot {\overset{->}{a}(t)} \cdot \ {\mathbb{d}t}}}} & (3.9) \end{matrix}$

This integral can be used to derive both the position and the velocity propagation formulas. For position, α=1 in the final result. For velocity, set α=0, T=1. Using the trapezoid method:

$\begin{matrix} {I_{n - 1} = \begin{matrix} {\frac{dt}{2} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot \left\lbrack {{\left( {T - {\alpha\; t_{n - 1}}} \right) \cdot {\overset{->}{a}\left( t_{n - 1} \right)}} +} \right.} \\ {\left. {{\left( {T - {\alpha\; t_{n}}} \right) \cdot \delta}\;{{\hat{C}\left( t_{n - 1} \right)} \cdot {\overset{->}{a}\left( t_{n} \right)}}} \right\rbrack + {o\left( {dt}^{3} \right)}} \end{matrix}} & (3.10) \end{matrix}$

Next, the same quantity is estimated, but using two half-steps:

$\begin{matrix} \begin{matrix} {I_{n - 1} = {\frac{dt}{4} \cdot {\hat{C}\left( t_{n - 1} \right)} \cdot}} \\ {\left\lbrack {{\left( {T - {\alpha\; t_{n - 1}}} \right) \cdot {\overset{\rightarrow}{a}\left( t_{n - 1} \right)}} + {2{\left( {T - {\alpha\; t_{n - {1/2}}}} \right) \cdot}}} \right.} \\ {{\delta\;{{{\hat{C}}_{1/2}\left( t_{n - 1} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n - {1/2}} \right)}}} + {\delta\;{{\hat{C}\left( t_{n} \right)} \cdot {\overset{\rightarrow}{a}\left( t_{n} \right)} \cdot \left( {T - {{+ \frac{1}{4}}{o\left( {dt}^{3} \right)}}} \right.}}} \end{matrix} & (3.11) \end{matrix}$

where δĈ_(1/2)(t_(n−1)) is the attitude matrix update from t_(n−1) to t_(n−1/2). The second term J is denoted and split it in two parts: J=2(T−αt _(n−1/2))δĈ _(1/2)(t _(n−1))·{right arrow over (a)} _(n−1/2)=(T−αt _(n))δĈ _(1/2)(t _(n−1))·{right arrow over (a)} _(n−1/2)+(T−αt _(n−1))δĈ _(1/2)(t _(n−1))·{right arrow over (a)} _(n−1/2)  (3.12)

Substituted in J are two separate expressions for the two occurrences of {right arrow over (a)}_(n−1/2) (hereafter omitting subscripts n, n−½, n−1 in the terms, where the exact subscript does not matter within the goal accuracy limit):

$\begin{matrix} {{{\overset{\rightarrow}{a}}_{n - {1/2}} = {{\overset{\rightarrow}{a}}_{n - 1} + {\frac{dt}{2}{\overset{.}{a}}_{n - 1}} + {\frac{{dt}^{2}}{8}\overset{¨}{a}}}}{{\overset{\rightarrow}{a}}_{n - {1/2}} = {{\overset{\rightarrow}{a}}_{n} - {\frac{dt}{2}{\overset{.}{a}}_{n - 1}} - {\frac{3{dt}^{2}}{8}\overset{¨}{a}}}}} & (3.13) \end{matrix}$

Substituting two separate expressions for δĈ_(1/2)(t_(n−1)). The first expression is from the general expression for δĈ:

$\begin{matrix} {{\delta\;{{\hat{C}}_{1/2}\left( t_{n - 1} \right)}} = {I - {\frac{dt}{4}\left( {{2\rho_{n - 1}} + {\frac{dt}{2}{\overset{.}{\rho}}_{n - 1}}} \right)} + {\frac{{dt}^{2}}{8}\rho^{2}}}} & (3.14) \end{matrix}$

The second expression for δĈ_(1/2)(t_(n−1)) is obtained from an identity: δĈ _(1/2)(t _(n−1))δĈ _(1/2)(t _(n−1/2))=δĈt _(n−1))  (3.15)

Then: δĈ _(1/2)(t _(n−1))=δĈ(t _(n−1))·[δĈ _(1/2)(t _(n−1/2))]⁻¹  (3.16)

For [δĈ_(1/2)(t_(n−1/2))]⁻¹ the following is used:

$\begin{matrix} \begin{matrix} {\left\lbrack {\delta\;{{\hat{C}}_{1/2}\left( t_{n - {1/2}} \right)}} \right\rbrack^{- 1} = {I + {\frac{dt}{4}\left( {\rho_{n - {1/2}} + \rho_{n - {1/2}}} \right)} + {\frac{{dt}^{2}}{8}\rho^{2}}}} \\ {= {I + {\frac{dt}{4}\left( {{2\rho_{n - 1}} + {\frac{3{dt}}{2}\overset{.}{\rho}}} \right)} + {\frac{{dt}^{2}}{8}\rho^{2}}}} \end{matrix} & (3.17) \end{matrix}$

All these substitutions yield:

$\begin{matrix} {J = {{\left( {T - {\alpha\; t_{n}}} \right)\delta\;{{\hat{C}\left( t_{n - 1} \right)} \cdot \left( {I + {\frac{dt}{2}\rho_{n - 1}} + {\frac{3{dt}^{2}}{8}\overset{.}{\rho}} + {\frac{{dt}^{2}}{8}\rho^{2}}} \right)}\left( {a_{n} - {\frac{dt}{2}{\overset{.}{a}}_{n - 1}} - {\frac{3{dt}^{2}}{8}\overset{¨}{a}}} \right)} + {\left( {T - {\alpha\; t_{n - 1}}} \right)\left( {I - {\frac{dt}{2}\rho_{n - 1}} - {\frac{{dt}^{2}}{8}{\overset{.}{\rho}}_{n - 1}} + {\frac{{dt}^{2}}{8}\rho^{2}}} \right)\left( {a_{n} + {\frac{dt}{2}{\overset{.}{a}}_{n - 1}} + {\frac{{dt}^{2}}{8}\overset{¨}{a}}} \right)}}} & (3.18) \end{matrix}$

Retaining terms with dt²:

$\begin{matrix} {J = {\left( {T - {\alpha\; t_{n}}} \right)\delta{{\hat{C}\left( t_{n - 1} \right)} \cdot \left( {a_{n} - {\frac{dt}{2}{\overset{.}{a}}_{n - 1}} - {\frac{3{dt}^{2}}{8}\overset{¨}{a}} + {\frac{dt}{2}\rho_{n - 1}a_{n}} - {\frac{{dt}^{2}}{4}\rho_{n - 1}{\overset{.}{a}}_{n - 1}\frac{3{dt}^{2}}{8}\overset{.}{\rho}a_{n}\frac{{dt}^{2}}{8}\rho^{2}a_{n}} + {\left( {T - {\alpha\; t_{n - 1}}} \right)\left( {a_{n - 1} + {\frac{dt}{2}{\overset{.}{a}}_{n - 1}} + {\frac{{dt}^{2}}{8}\overset{¨}{a}} - {\frac{dt}{2}\rho_{n - 1}a_{n - 1}} - {\frac{{dt}^{2}}{4}\rho_{n - 1}{\overset{.}{a}}_{n - 1}} - {\frac{{dt}^{2}}{8}\overset{.}{\rho}a} + {\frac{{dt}^{2}}{8}\rho^{2}a}} \right)}} \right.}}} & (3.19) \end{matrix}$

Extracting the main term, and all other terms estimate to the second order with respect to dt. For this computation, δĈ(t_(n−1))≈I−dtρ, etc. is used:

$\begin{matrix} {J = {\left\{ {{\left( {T - {\alpha\; t_{n}}} \right)\delta{{\hat{C}\left( t_{n - 1} \right)} \cdot a_{n}}} + {\left( {T - {\alpha\; t_{n - 1}}} \right)a_{n - 1}}} \right\} + {\left( {T - {\alpha\; t_{n - 1}} - {\alpha\;{dt}}} \right)\left( {I - {{dt}\;\rho}} \right)\left( {{{- \frac{dt}{2}}{\overset{.}{a}}_{n - 1}} - {\frac{3{dt}^{2}}{8}\overset{¨}{a}} + {\frac{dt}{2}\rho_{n - 1}a_{n}} - {\frac{{dt}^{2}}{4}\rho_{n - 1}{\overset{.}{a}}_{n - 1}\frac{3{dt}^{2}}{8}\overset{.}{\rho}a_{n}\frac{{dt}^{2}}{8}\rho^{2}a_{n}} + {\left( {T - {\alpha\; t_{n - 1}}} \right)\left( {{\frac{dt}{2}{\overset{.}{a}}_{n - 1}} + {\frac{{dt}^{2}}{8}\overset{¨}{a}} - {\frac{dt}{2}\rho_{n - 1}a_{n - 1}} - {\frac{{dt}^{2}}{4}\rho_{n - 1}{\overset{.}{a}}_{n - 1}} - {\frac{{dt}^{2}}{8}\overset{.}{\rho}a} + {\frac{{dt}^{2}}{8}\rho^{2}a}} \right)}} \right.}}} & (3.20) \end{matrix}$

Once again, only terms which have the second order (or lower) with respect to dt are retained:

$\begin{matrix} {J = {\left\{ {{\frac{1}{2}\left( {T - {\alpha\; t_{n}}} \right)\delta{{\hat{C}\left( t_{n - 1} \right)} \cdot a_{n}}} + {\frac{1}{2}\left( {T - {\alpha\; t_{n - 1}}} \right)a_{n - 1}}} \right\} + {\frac{{dt}^{2}}{2}{\quad\left\lbrack {{\left( {T - {\alpha\; t_{n - 1}}} \right) \cdot \left( {{\rho\overset{.}{a}} - {\frac{1}{2}\overset{¨}{a}} + {\frac{1}{2}\overset{.}{\rho}a} - {\frac{1}{2}\rho^{2}a_{n}}} \right)} + {\alpha \cdot \left( {\overset{.}{a} - {\rho\; a}} \right)}} \right\rbrack}}}} & (3.21) \end{matrix}$

Substitution of this expression in the second equation (the one obtained from two half-step formula) for I_(n−1) yields:

$\begin{matrix} {I_{n - 1} = {{{\hat{C}\left( t_{n - 1} \right)} \cdot \left\{ {{\frac{1}{2}\left( {T - {\alpha\; t_{n}}} \right)\delta{{\hat{C}\left( t_{n - 1} \right)} \cdot a_{n}}} + {\frac{1}{2}\left( {T - {\alpha\; t_{n - 1}}} \right)a_{n - 1}}} \right\}} + {{\hat{C}\left( t_{n - 1} \right)} \cdot {\frac{{dt}^{3}}{8}\left\lbrack {{\left( {T - {\alpha\; t_{n - 1}}} \right)\left( {{\rho\overset{.}{a}} - {\frac{1}{2}\overset{¨}{a}} + {\frac{1}{2}\overset{.}{\rho}a} - {\frac{1}{2}\rho^{2}a_{n}}} \right)} + {\alpha \cdot \left( {\overset{.}{a} - {\rho\; a}} \right)}} \right\rbrack}} + {\frac{1}{4}{o\left( {dt}^{3} \right)}}}} & (3.22) \end{matrix}$

Comparison with the one-step formula yields:

$\begin{matrix} {{o\left( {dt}^{3} \right)} = {\frac{{dt}^{3}}{6}{{\hat{C}\left( t_{n - 1} \right)} \cdot \left\lbrack {{\left( {T - {\alpha\; t_{n - 1}}} \right)\left( {{\rho\overset{.}{a}} - {\frac{1}{2}\overset{¨}{a}} + {\frac{1}{2}\overset{.}{\rho}a} - {\frac{1}{2}\rho^{2}a_{n}}} \right)} + {\alpha \cdot \left( {\overset{.}{a} - {\rho\; a}} \right)}} \right\rbrack}}} & (3.23) \end{matrix}$

which produces the final expression:

$\begin{matrix} {I_{n - 1} = {{{\hat{C}\left( t_{n - 1} \right)} \cdot \left\{ {{\frac{1}{2}\left( {T - {\alpha\; t_{n}}} \right)\delta\;{{\hat{C}\left( t_{n - 1} \right)} \cdot a_{n}}} + {\frac{1}{2}\left( {T - {\alpha\; t_{n - 1}}} \right)a_{n - 1}}} \right\}} + {\frac{{dt}^{3}}{6}{{\hat{C}\left( t_{n - 1} \right)} \cdot \left\lbrack {{\left( {T - {\alpha\; t_{n - 1}}} \right)\left( {{\rho\;\overset{.}{a}} - {\frac{1}{2}\overset{¨}{a}} + {\frac{1}{2}\overset{.}{\rho}a} - {\frac{1}{2}\rho^{2}a}} \right)} + {\alpha \cdot \left( {\overset{.}{a} - {\rho\; a}} \right)}} \right\rbrack}}}} & (3.24) \end{matrix}$

To summarize, a method is provided for determining navigational parameters of a moving object, comprising making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; and estimating at least one navigation parameter of the moving object from the PR measurements and the ADR differences.

Similarly, a method is providing for determining the position and velocity of a moving object, comprising making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; and estimating components of a state vector comprising at least position and velocity of the object at a current state from the PR measurements and the ADR differences and the state vector at a prior state.

Further yet, the methodology described herein may be embodied in a processor or computer readable medium storing instructions (e.g., software) that, when executed by processor or computer, cause the processor or computer to: obtain pseudorange (PR) measurements at the object from signals received from ranging signal sources; obtain accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; compute ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; and estimate at least one navigational parameter of the moving object from the PR measurements and the ADR differences.

The system and methods described herein may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The foregoing embodiments are therefore to be considered in all respects illustrative and not meant to be limiting. 

1. A method of determining navigational parameters of a moving object, comprising: making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; determining an optimal time interval between ADR measurements to be used for computing the ADR differences; and estimating at least one navigation parameter of the moving object from the PR measurements and the ADR differences.
 2. The method of claim 1, wherein determining the optimal time interval between ADR measurements comprises computing a minimum of a variance of a velocity estimate error for two ADR measurements.
 3. The method of claim 2, wherein determining the optimal time interval is dependent on an accuracy of the propagation model, such that the optimal time interval can be longer when a more accurate propagation model is used.
 4. The method of claim 1, wherein estimating comprises computing partial derivatives of the ADR differences with respect to at least a velocity component of a state vector that represents position and velocity of the object to derive instantaneous velocity estimates of the object.
 5. The method of claim 1, wherein (a) making comprises making PR measurements at the object from signals received from global positioning satellites (GPS).
 6. The method of claim 1, wherein the time interval between consecutive ADR measurements is on the order of 100 seconds.
 7. The method of claim 1, wherein estimating comprises applying a mathematical formulation that maps the ADR differences to a current state vector of the object, wherein the state vector comprises at least position and velocity of the object.
 8. A method of determining navigational parameters of a moving object, comprising: making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; estimating at least one navigation parameter of the moving object from the PR measurements and the ADR differences, wherein estimating comprises computing partial derivatives of the ADR differences with respect to at least a velocity component of a state vector that represents position and velocity of the object to derive instantaneous velocity estimates of the object and propagating the state vector with propagation equations that compute the state vector for the object at time N based on the state vector at time N−1.
 9. The method of claim 8, wherein computing partial derivatives comprising computing partial derivatives of the ADR differences with respect to position and velocity of the state vector; computing partial derivatives of the ADR differences with respect to a clock and a clock drift of the object; and computing instantaneous velocity estimates of the object by using these partial derivatives in a Kalman filter to process ADR differences.
 10. The method of claim 9, wherein estimating the position of the moving object comprises computing position and velocity components of the state vector using the PR measurements and the estimated instantaneous velocity measurements.
 11. The method of claim 10, wherein computing partial derivatives of the ADR differences comprises computing derivatives of the object position at a past epoch with respect to a state vector at a current epoch, wherein the state vector comprises components for at least position and velocity of the object at an epoch.
 12. The method of claim 11, wherein computing derivatives of the object position at a past epoch with respect to the state vector at a current epoch comprises computing a higher-order approximation with respect to a time difference between consecutive epochs.
 13. The method of claim 12, wherein computing a higher-order approximation comprises propagating the state vector backwards over a time interval separating ADR measurements using a propagation routine having multiple substeps; for each of the substeps of the propagation routine, computing a φ matrix that corresponds to an element of a Λ matrix; computing the Λ matrix from each of the φ matrices; using the Λ matrix, computing partials of the object position at a past epoch with respect to position and velocity of the state vector.
 14. The method of claim 13, and further comprising propagating the state vector using a force model and an integration routine, and propagating a covariance matrix by computing a partial derivative of the state vector at the next epoch with respect to the state vector at the current epoch.
 15. The method of claim 14, wherein the state vector has partitions for position, velocity, clock and clock drift of the object, wherein propagating the state vector comprises computing a matrix having partitions for derivatives of positions with respect to velocity, derivatives of position with respect to clock, derivatives of position with respect to clock drift, derivatives of velocity with respect to position, derivatives of velocity with respect to clock and derivatives of velocity with respect to clock drift.
 16. A method of determining navigational parameters of a moving object, comprising: making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements at two epochs separated by a time interval which is greater than a time period between consecutive epochs at which ADR measurements are made; estimating at least one navigation parameter of the moving object from the PR measurements and the ADR differences.
 17. The method of claim 16, wherein (c) computing comprises computing ADR differences between ADR measurements at two epochs separated by said time interval which is several orders of magnitude greater than the time period between consecutive epochs at which ADR measurements are made.
 18. A method of determining navigational parameters of a moving object, comprising: making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; estimating at least one navigation parameter of the moving object from the PR measurements and the ADR differences, wherein estimating further comprises propagating a state vector based on inertial measurement data produced by an inertial measurement unit (IMU) associated with said object.
 19. The method of claim 18, wherein propagating comprises computing an observation matrix comprising partial derivatives of the ADR differences with respect to a state vector for the object, wherein the state vector comprises an estimate of the position, velocity, attitude and error states of inertial measurement data produced by the IMU associated with said object.
 20. The method of claim 19, wherein computing the observation matrix comprises computing a rotation matrix that transforms a vector representing gyro sensor data in body axes of the IMU to an earth centered inertial (ECI) coordinate system and propagating the rotation matrix over an epoch in order to propagate the attitude component of the state vector.
 21. The method of claim 20, wherein computing the observation matrix comprises propagating the position and velocity components of the state vector.
 22. The method of claim 21, and further comprising computing a misalignment vector that characterizes misalignment parameters of the gyro sensor in the IMU, including the misalignment vector in the Kalman filter state vector.
 23. The method of claim 22, and further comprising computing partial derivatives of the state vector at the end of each epoch with respect to the state vector at the start of the epoch to produce a forward propagation matrix, wherein at each epoch the attitude partition of the state vector is represented by Euler angles with respect to a current estimate of the attitude.
 24. The method of claim 23, and further comprising computing a backward propagation matrix over multiple epochs.
 25. The method of claim 24, and further comprising backward propagating the state vector with the backward propagation matrix using a recursive algorithm.
 26. A method for determining the position and velocity of a moving object, comprising: making pseudorange (PR) measurements at the object from signals received from ranging signal sources; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; and estimating components of a state vector comprising at least position and velocity of the object at a current state from the PR measurements and the ADR differences and the state vector at a prior state, wherein estimating comprises computing partial derivatives of the ADR differences with respect to at least a velocity component of the state vector to derive instantaneous velocity estimates of the object.
 27. The method of claim 26, wherein computing comprises computing ADR differences for ADR measurements separated by said time interval, wherein said time interval is determined by computing a minimum of a variance of a velocity estimate error for two ADR measurements.
 28. The method of claim 26, wherein computing partial derivatives of the ADR differences comprises computing derivatives of the object position at a past epoch with respect to the state vector at a current epoch.
 29. The method of claim 28, wherein computing derivatives of the object position at a past epoch with respect to the state vector at a current epoch comprises computing a higher-order approximation with respect to a time difference between consecutive epochs.
 30. The method of claim 29, wherein computing a higher-order approximation comprises propagating the state vector backwards over a time interval separating ADR measurements using a propagation routine having multiple substeps; for each of the substeps of the propagation routine, computing a φ matrix that corresponds to an element of a Λ matrix; computing the Λ matrix from each of the φ matrices; using the Λ matrix, computing partials of the object position at a past epoch with respect to position and velocity of the state vector.
 31. The method of claim 30, and further comprising propagating the state vector using a force model and an integration routine, and propagating a covariance matrix by computing a partial derivative of the state vector at the next epoch with respect to the state vector at the current epoch.
 32. The method of claim 26, wherein estimating comprises propagating the state vector with propagation equations that compute the state vector for the object at time N based on the state vector at time N−1.
 33. The method of claim 26, wherein estimating comprises processing with a Kalman filter an ADR measurement residual for a pair of ranging signal sources with a partials matrix comprising a first partition for the object position and velocity defined by a difference of two terms, each term for a corresponding ranging signal source, and a second partition for the object clock and clock drift.
 34. The method of claim 26, wherein computing comprises computing ADR differences between ADR measurements at two epochs separated by said time interval which is several orders of magnitude greater than a time period between consecutive epochs at which ADR measurements are made.
 35. The method of claim 26, wherein estimating further comprises propagating the state vector based on inertial measurement data produced by an inertial measurement unit (IMU) associated with said object.
 36. The method of claim 35, wherein propagating comprises computing an observation matrix comprising partial derivatives of the ADR differences with respect to a state vector for the object, wherein the state vector further comprises an estimate of the attitude and error states of inertial measurement data produced by the IMU associated with said object.
 37. The method of claim 36, wherein computing the observation matrix comprises computing a rotation matrix that transforms a vector representing gyro sensor data in body axes of the IMU to an earth centered inertial (ECI) coordinate system and propagating the rotation matrix over an epoch in order to propagate the attitude component of the state vector.
 38. The method of claim 37, wherein computing the observation matrix comprises propagating the position and velocity components of the state vector, and further comprising computing a misalignment vector that characterizes misalignment parameters of the gyro sensor in the IMU, including the misalignment vector in the Kalman filter state vector.
 39. The method of claim 38, and further comprising computing partial derivatives of the state vector at the end of each epoch with respect to the state vector at the start of the epoch to produce a forward propagation matrix, wherein at each epoch the attitude partition of the state vector is represented by Euler angles with respect to a current estimate of the attitude.
 40. The method of claim 39, and further computing a backward propagation matrix over multiple epochs, and backward propagating the state vector with the backward propagation matrix using recursive.
 41. The method of claim 26, wherein the time interval between consecutive ADR measurements is on the order of 100 seconds.
 42. The method of claim 26, wherein making ADR measurements comprises making ADR measurements of the object while it has a non-constant velocity between consecutive ADR measurements.
 43. The method of claim 26, wherein estimating comprises applying a mathematical formulation that maps the ADR differences to the current state vector of the object.
 44. A processor readable medium storing instructions that, when executed by a processor, cause the processor to: obtain pseudorange (PR) measurements at the object from signals received from ranging signal sources; obtain accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; compute ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; and estimate at least one navigational parameter of the moving object from the PR measurements and the ADR differences by applying a mathematical formulation that maps the ADR differences to a current state vector of the object, wherein the state vector comprises at least position and velocity of the object.
 45. The processor readable medium of claim 44, and further comprising instructions that cause the processor to obtain ADR measurements such that the time interval between consecutive ADR measurements is on the order of 100 seconds.
 46. The processor readable medium of claim 44, and further comprising instructions that cause the processor to obtain ADR measurements of the object while it has a non-constant velocity between consecutive ADR measurements.
 47. A method of determining navigational parameters of a moving object, comprising: making pseudorange (PR) measurements at the object from signals received from ranging signal sources, wherein making ADR measurements comprises making ADR measurements of the object while it has a non-constant velocity between consecutive ADR measurements; making accumulated delta range (ADR) measurements at the object from signals received from the ranging signal sources; computing ADR differences between ADR measurements separated by a time interval that is greater than a time interval between consecutive ADR measurements; and estimating at least one navigation parameter of the moving object from the PR measurements and the ADR differences. 